./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:48:17,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:48:17,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:48:17,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:48:17,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:48:17,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:48:17,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:48:17,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:48:17,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:48:17,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:48:17,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:48:17,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:48:17,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:48:17,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:48:17,160 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:48:17,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:48:17,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:48:17,160 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:48:17,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:48:17,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:48:17,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:48:17,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:48:17,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:48:17,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:48:17,164 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:48:17,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:48:17,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:48:17,165 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:48:17,165 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:48:17,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:48:17,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:48:17,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:48:17,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:48:17,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:48:17,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:48:17,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:48:17,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:48:17,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:48:17,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:48:17,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:48:17,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:48:17,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:48:17,167 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 [2024-11-16 13:48:17,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:48:17,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:48:17,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:48:17,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:48:17,381 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:48:17,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-16 13:48:18,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:48:18,727 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:48:18,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-16 13:48:18,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22c00ff2/3d623cad5f6d4c12be74528cd7f41bfd/FLAG30f9bc0df [2024-11-16 13:48:19,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22c00ff2/3d623cad5f6d4c12be74528cd7f41bfd [2024-11-16 13:48:19,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:48:19,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:48:19,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:48:19,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:48:19,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:48:19,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c1feae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19, skipping insertion in model container [2024-11-16 13:48:19,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:48:19,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2024-11-16 13:48:19,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:48:19,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:48:19,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2024-11-16 13:48:19,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:48:19,394 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:48:19,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19 WrapperNode [2024-11-16 13:48:19,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:48:19,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:48:19,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:48:19,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:48:19,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,440 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-16 13:48:19,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:48:19,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:48:19,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:48:19,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:48:19,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,472 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 13:48:19,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:48:19,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:48:19,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:48:19,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:48:19,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (1/1) ... [2024-11-16 13:48:19,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:48:19,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:48:19,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 13:48:19,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 13:48:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:48:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:48:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:48:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:48:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:48:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:48:19,619 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:48:19,620 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:48:19,861 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L177: havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2024-11-16 13:48:19,890 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 13:48:19,890 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:48:19,913 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:48:19,913 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-16 13:48:19,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:48:19 BoogieIcfgContainer [2024-11-16 13:48:19,914 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:48:19,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:48:19,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:48:19,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:48:19,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:48:19" (1/3) ... [2024-11-16 13:48:19,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7257c2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:48:19, skipping insertion in model container [2024-11-16 13:48:19,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:19" (2/3) ... [2024-11-16 13:48:19,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7257c2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:48:19, skipping insertion in model container [2024-11-16 13:48:19,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:48:19" (3/3) ... [2024-11-16 13:48:19,921 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-16 13:48:19,934 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:48:19,935 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:48:19,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:48:19,984 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@213d8f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:48:19,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:48:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 13:48:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 13:48:20,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:20,008 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:20,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:20,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:20,013 INFO L85 PathProgramCache]: Analyzing trace with hash -127502355, now seen corresponding path program 1 times [2024-11-16 13:48:20,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:48:20,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118399542] [2024-11-16 13:48:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:48:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:48:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:48:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:48:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:48:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:48:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:48:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:48:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:48:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:48:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:48:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:48:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:48:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:48:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:48:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:48:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:48:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:48:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:48:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:48:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:48:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:48:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:48:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:48:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:48:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:48:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:48:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 13:48:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:48:20,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118399542] [2024-11-16 13:48:20,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118399542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:48:20,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:48:20,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:48:20,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84896949] [2024-11-16 13:48:20,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:48:20,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:48:20,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:48:20,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:48:20,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:48:20,477 INFO L87 Difference]: Start difference. First operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 13:48:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:20,514 INFO L93 Difference]: Finished difference Result 180 states and 309 transitions. [2024-11-16 13:48:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:48:20,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2024-11-16 13:48:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:20,523 INFO L225 Difference]: With dead ends: 180 [2024-11-16 13:48:20,524 INFO L226 Difference]: Without dead ends: 89 [2024-11-16 13:48:20,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:48:20,530 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:20,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:48:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-16 13:48:20,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-16 13:48:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 13:48:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2024-11-16 13:48:20,571 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 174 [2024-11-16 13:48:20,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:20,572 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2024-11-16 13:48:20,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 13:48:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2024-11-16 13:48:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 13:48:20,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:20,575 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:20,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:48:20,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:20,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash 979948775, now seen corresponding path program 1 times [2024-11-16 13:48:20,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:48:20,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990432264] [2024-11-16 13:48:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:48:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:48:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:48:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:48:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:48:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:48:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:48:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:48:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:48:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:48:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:48:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:48:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:48:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:48:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:48:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:48:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:20,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:48:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:48:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:48:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:48:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:48:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:48:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:48:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:48:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:48:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:48:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:48:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 13:48:21,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:48:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990432264] [2024-11-16 13:48:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990432264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:48:21,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:48:21,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:48:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260955474] [2024-11-16 13:48:21,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:48:21,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:48:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:48:21,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:48:21,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:48:21,048 INFO L87 Difference]: Start difference. First operand 89 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 13:48:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:21,128 INFO L93 Difference]: Finished difference Result 261 states and 399 transitions. [2024-11-16 13:48:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:48:21,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-16 13:48:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:21,132 INFO L225 Difference]: With dead ends: 261 [2024-11-16 13:48:21,134 INFO L226 Difference]: Without dead ends: 175 [2024-11-16 13:48:21,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:48:21,136 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 79 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:21,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 449 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:48:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-16 13:48:21,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2024-11-16 13:48:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 115 states have internal predecessors, (155), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 13:48:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 259 transitions. [2024-11-16 13:48:21,173 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 259 transitions. Word has length 174 [2024-11-16 13:48:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:21,174 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 259 transitions. [2024-11-16 13:48:21,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 13:48:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 259 transitions. [2024-11-16 13:48:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-16 13:48:21,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:21,177 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:21,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:48:21,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:21,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1461882871, now seen corresponding path program 1 times [2024-11-16 13:48:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:48:21,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270068479] [2024-11-16 13:48:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:21,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:48:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:48:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:48:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:48:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:48:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:48:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:48:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:48:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:48:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:48:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:48:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:48:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:48:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:48:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:48:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:48:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:48:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:48:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:48:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:48:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:48:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:48:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:48:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:48:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:48:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:48:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:48:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 13:48:21,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:48:21,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270068479] [2024-11-16 13:48:21,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270068479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:48:21,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:48:21,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:48:21,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044424691] [2024-11-16 13:48:21,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:48:21,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:48:21,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:48:21,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:48:21,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:48:21,656 INFO L87 Difference]: Start difference. First operand 170 states and 259 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 13:48:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:21,920 INFO L93 Difference]: Finished difference Result 450 states and 681 transitions. [2024-11-16 13:48:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:48:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-16 13:48:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:21,923 INFO L225 Difference]: With dead ends: 450 [2024-11-16 13:48:21,925 INFO L226 Difference]: Without dead ends: 283 [2024-11-16 13:48:21,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:48:21,927 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 135 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:21,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 530 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:48:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-16 13:48:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2024-11-16 13:48:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 205 states have (on average 1.3707317073170733) internal successors, (281), 207 states have internal predecessors, (281), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-16 13:48:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 417 transitions. [2024-11-16 13:48:21,968 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 417 transitions. Word has length 175 [2024-11-16 13:48:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:21,968 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 417 transitions. [2024-11-16 13:48:21,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 13:48:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 417 transitions. [2024-11-16 13:48:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-16 13:48:21,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:21,971 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:21,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:48:21,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:21,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash -615326472, now seen corresponding path program 1 times [2024-11-16 13:48:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:48:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134892200] [2024-11-16 13:48:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:21,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:48:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:48:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:48:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:48:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:48:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:48:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:48:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:48:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:48:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:48:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:48:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:48:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:48:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:48:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:48:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:48:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:48:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:48:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:48:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:48:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:48:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:48:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:48:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:48:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:48:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:48:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:48:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 13:48:22,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:48:22,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134892200] [2024-11-16 13:48:22,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134892200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:48:22,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:48:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:48:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910558236] [2024-11-16 13:48:22,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:48:22,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:48:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:48:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:48:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:48:22,205 INFO L87 Difference]: Start difference. First operand 278 states and 417 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 13:48:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:22,407 INFO L93 Difference]: Finished difference Result 827 states and 1243 transitions. [2024-11-16 13:48:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:48:22,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-16 13:48:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:22,415 INFO L225 Difference]: With dead ends: 827 [2024-11-16 13:48:22,415 INFO L226 Difference]: Without dead ends: 552 [2024-11-16 13:48:22,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:48:22,417 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 202 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:22,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 341 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:48:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-16 13:48:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 544. [2024-11-16 13:48:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 399 states have (on average 1.3709273182957393) internal successors, (547), 403 states have internal predecessors, (547), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-16 13:48:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 819 transitions. [2024-11-16 13:48:22,476 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 819 transitions. Word has length 175 [2024-11-16 13:48:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:22,476 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 819 transitions. [2024-11-16 13:48:22,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 13:48:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 819 transitions. [2024-11-16 13:48:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 13:48:22,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:22,479 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:22,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:48:22,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:22,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash -747184535, now seen corresponding path program 1 times [2024-11-16 13:48:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:48:22,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985139485] [2024-11-16 13:48:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:48:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:48:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:48:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:48:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:48:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:48:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:48:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:48:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:48:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:48:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:48:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:48:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:48:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:48:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:48:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:48:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:48:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:48:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:48:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:48:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:48:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:48:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:48:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:48:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:48:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:48:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:48:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-16 13:48:22,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:48:22,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985139485] [2024-11-16 13:48:22,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985139485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:48:22,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735176727] [2024-11-16 13:48:22,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:22,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:22,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:48:22,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:48:22,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 13:48:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:22,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 13:48:22,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 633 proven. 27 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-16 13:48:23,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:48:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-16 13:48:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735176727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:48:23,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:48:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 13:48:23,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792080388] [2024-11-16 13:48:23,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:48:23,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 13:48:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:48:23,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 13:48:23,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:48:23,189 INFO L87 Difference]: Start difference. First operand 544 states and 819 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-16 13:48:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:23,387 INFO L93 Difference]: Finished difference Result 1117 states and 1663 transitions. [2024-11-16 13:48:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 13:48:23,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 176 [2024-11-16 13:48:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:23,391 INFO L225 Difference]: With dead ends: 1117 [2024-11-16 13:48:23,392 INFO L226 Difference]: Without dead ends: 576 [2024-11-16 13:48:23,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-16 13:48:23,394 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 133 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:23,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 243 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:48:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-16 13:48:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2024-11-16 13:48:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 411 states have (on average 1.340632603406326) internal successors, (551), 415 states have internal predecessors, (551), 136 states have call successors, (136), 12 states have call predecessors, (136), 12 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-16 13:48:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 823 transitions. [2024-11-16 13:48:23,439 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 823 transitions. Word has length 176 [2024-11-16 13:48:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:23,440 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 823 transitions. [2024-11-16 13:48:23,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-16 13:48:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 823 transitions. [2024-11-16 13:48:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 13:48:23,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:23,442 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:23,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 13:48:23,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:23,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash 82962762, now seen corresponding path program 1 times [2024-11-16 13:48:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:48:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997053514] [2024-11-16 13:48:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:48:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:48:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:48:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:48:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:48:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:48:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:48:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:48:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:48:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:48:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:48:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:48:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:48:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:48:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:48:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:48:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:48:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:48:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:48:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:48:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:48:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:48:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:48:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:48:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:48:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:48:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:48:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 90 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2024-11-16 13:48:24,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:48:24,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997053514] [2024-11-16 13:48:24,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997053514] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:48:24,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131304749] [2024-11-16 13:48:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:24,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:24,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:48:24,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:48:24,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 13:48:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:24,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 13:48:24,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2024-11-16 13:48:24,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:48:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2024-11-16 13:48:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131304749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:48:25,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:48:25,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 23 [2024-11-16 13:48:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104600788] [2024-11-16 13:48:25,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:48:25,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 13:48:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:48:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 13:48:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2024-11-16 13:48:25,256 INFO L87 Difference]: Start difference. First operand 560 states and 823 transitions. Second operand has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-16 13:48:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:26,398 INFO L93 Difference]: Finished difference Result 1269 states and 1808 transitions. [2024-11-16 13:48:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-16 13:48:26,399 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 176 [2024-11-16 13:48:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:26,405 INFO L225 Difference]: With dead ends: 1269 [2024-11-16 13:48:26,405 INFO L226 Difference]: Without dead ends: 985 [2024-11-16 13:48:26,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 393 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=638, Invalid=1912, Unknown=0, NotChecked=0, Total=2550 [2024-11-16 13:48:26,407 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 706 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:26,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1014 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 13:48:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-16 13:48:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 777. [2024-11-16 13:48:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 564 states have (on average 1.301418439716312) internal successors, (734), 570 states have internal predecessors, (734), 182 states have call successors, (182), 30 states have call predecessors, (182), 30 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2024-11-16 13:48:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1098 transitions. [2024-11-16 13:48:26,468 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1098 transitions. Word has length 176 [2024-11-16 13:48:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:26,468 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1098 transitions. [2024-11-16 13:48:26,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-16 13:48:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1098 transitions. [2024-11-16 13:48:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 13:48:26,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:26,470 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:26,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 13:48:26,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 13:48:26,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:26,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash -753212819, now seen corresponding path program 1 times [2024-11-16 13:48:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:48:26,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958848237] [2024-11-16 13:48:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:48:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:48:26,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999116866] [2024-11-16 13:48:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:26,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:26,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:48:26,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:48:26,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 13:48:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:26,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 13:48:26,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 333 proven. 9 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2024-11-16 13:48:27,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:48:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-16 13:48:27,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:48:27,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958848237] [2024-11-16 13:48:27,313 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 13:48:27,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999116866] [2024-11-16 13:48:27,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999116866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:48:27,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:48:27,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-16 13:48:27,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329234896] [2024-11-16 13:48:27,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:48:27,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 13:48:27,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:48:27,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 13:48:27,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-16 13:48:27,315 INFO L87 Difference]: Start difference. First operand 777 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-16 13:48:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:28,372 INFO L93 Difference]: Finished difference Result 2067 states and 2875 transitions. [2024-11-16 13:48:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 13:48:28,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 176 [2024-11-16 13:48:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:28,379 INFO L225 Difference]: With dead ends: 2067 [2024-11-16 13:48:28,380 INFO L226 Difference]: Without dead ends: 1315 [2024-11-16 13:48:28,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2024-11-16 13:48:28,382 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 275 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:28,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 446 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 13:48:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-16 13:48:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1053. [2024-11-16 13:48:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 789 states have (on average 1.296577946768061) internal successors, (1023), 800 states have internal predecessors, (1023), 222 states have call successors, (222), 41 states have call predecessors, (222), 41 states have return successors, (222), 211 states have call predecessors, (222), 222 states have call successors, (222) [2024-11-16 13:48:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1467 transitions. [2024-11-16 13:48:28,510 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1467 transitions. Word has length 176 [2024-11-16 13:48:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:28,511 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1467 transitions. [2024-11-16 13:48:28,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-16 13:48:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1467 transitions. [2024-11-16 13:48:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 13:48:28,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:28,514 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:28,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 13:48:28,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:28,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:28,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash -114675621, now seen corresponding path program 1 times [2024-11-16 13:48:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:48:28,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326331287] [2024-11-16 13:48:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:48:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:48:28,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106281639] [2024-11-16 13:48:28,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:28,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:28,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:48:28,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:48:28,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 13:48:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:29,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 13:48:29,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-16 13:48:29,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:48:30,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:48:30,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326331287] [2024-11-16 13:48:30,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 13:48:30,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106281639] [2024-11-16 13:48:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106281639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:48:30,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 13:48:30,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-16 13:48:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665530174] [2024-11-16 13:48:30,273 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 13:48:30,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 13:48:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:48:30,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 13:48:30,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=214, Unknown=5, NotChecked=0, Total=306 [2024-11-16 13:48:30,274 INFO L87 Difference]: Start difference. First operand 1053 states and 1467 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 13:48:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:31,124 INFO L93 Difference]: Finished difference Result 2320 states and 3159 transitions. [2024-11-16 13:48:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 13:48:31,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 176 [2024-11-16 13:48:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:31,130 INFO L225 Difference]: With dead ends: 2320 [2024-11-16 13:48:31,130 INFO L226 Difference]: Without dead ends: 1296 [2024-11-16 13:48:31,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=314, Invalid=673, Unknown=5, NotChecked=0, Total=992 [2024-11-16 13:48:31,133 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 301 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:31,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 680 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 13:48:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-11-16 13:48:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 963. [2024-11-16 13:48:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 733 states have (on average 1.290586630286494) internal successors, (946), 739 states have internal predecessors, (946), 182 states have call successors, (182), 47 states have call predecessors, (182), 47 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2024-11-16 13:48:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1310 transitions. [2024-11-16 13:48:31,211 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1310 transitions. Word has length 176 [2024-11-16 13:48:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:31,212 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1310 transitions. [2024-11-16 13:48:31,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 13:48:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1310 transitions. [2024-11-16 13:48:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-16 13:48:31,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:31,213 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:31,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 13:48:31,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:31,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash 831102545, now seen corresponding path program 1 times [2024-11-16 13:48:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:48:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978147785] [2024-11-16 13:48:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:31,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:48:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:48:31,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168981616] [2024-11-16 13:48:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:31,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:31,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:48:31,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:48:31,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 13:48:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:48:31,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:48:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:48:31,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:48:31,827 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:48:31,828 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:48:31,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 13:48:32,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:32,032 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:32,120 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:48:32,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:48:32 BoogieIcfgContainer [2024-11-16 13:48:32,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:48:32,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:48:32,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:48:32,122 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:48:32,123 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:48:19" (3/4) ... [2024-11-16 13:48:32,125 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:48:32,125 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:48:32,126 INFO L158 Benchmark]: Toolchain (without parser) took 13002.42ms. Allocated memory was 176.2MB in the beginning and 369.1MB in the end (delta: 192.9MB). Free memory was 119.9MB in the beginning and 215.0MB in the end (delta: -95.1MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2024-11-16 13:48:32,126 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:48:32,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.21ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 102.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 13:48:32,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.29ms. Allocated memory is still 176.2MB. Free memory was 102.6MB in the beginning and 99.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:48:32,126 INFO L158 Benchmark]: Boogie Preprocessor took 54.21ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 94.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:48:32,126 INFO L158 Benchmark]: IcfgBuilder took 418.48ms. Allocated memory is still 176.2MB. Free memory was 94.8MB in the beginning and 68.3MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 13:48:32,127 INFO L158 Benchmark]: TraceAbstraction took 12206.48ms. Allocated memory was 176.2MB in the beginning and 369.1MB in the end (delta: 192.9MB). Free memory was 67.5MB in the beginning and 215.0MB in the end (delta: -147.5MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-11-16 13:48:32,127 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 369.1MB. Free memory is still 215.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:48:32,128 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.21ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 102.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.29ms. Allocated memory is still 176.2MB. Free memory was 102.6MB in the beginning and 99.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.21ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 94.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 418.48ms. Allocated memory is still 176.2MB. Free memory was 94.8MB in the beginning and 68.3MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12206.48ms. Allocated memory was 176.2MB in the beginning and 369.1MB in the end (delta: 192.9MB). Free memory was 67.5MB in the beginning and 215.0MB in the end (delta: -147.5MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 369.1MB. Free memory is still 215.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryArithmeticFLOAToperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] unsigned short int var_1_25 = 32; [L44] unsigned char var_1_29 = 1; [L45] unsigned long int var_1_31 = 0; [L46] unsigned char var_1_32 = 1; [L47] unsigned short int var_1_33 = 1000; [L48] signed char var_1_38 = 25; [L49] unsigned short int var_1_39 = 200; [L50] unsigned char var_1_43 = 10; [L51] unsigned char var_1_47 = 0; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=0, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] FCALL updateLastVariables() [L185] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L136] var_1_3 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L139] var_1_4 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L140] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L141] var_1_5 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L142] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L143] var_1_6 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L144] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L145] var_1_7 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L146] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L151] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L154] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L157] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L160] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L165] var_1_33 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L166] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_33 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] RET assume_abort_if_not(var_1_33 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L169] var_1_39 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L170] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_39 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] RET assume_abort_if_not(var_1_39 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L56] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L58] var_1_20 = var_1_11 [L59] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L60] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L60] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L61] COND TRUE var_1_12 != var_1_21 [L62] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L67] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L78] unsigned char stepLocal_1 = var_1_14; [L79] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L80] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L81] COND TRUE stepLocal_1 || var_1_14 [L82] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L89] COND FALSE !(var_1_6 > (- var_1_7)) [L94] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L96] var_1_22 = var_1_8 [L97] var_1_23 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L98] COND FALSE !(var_1_11 < var_1_12) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L103] var_1_29 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L104] COND TRUE var_1_11 >= var_1_11 [L105] var_1_31 = ((((var_1_11) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_11) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L107] COND TRUE var_1_20 < (~ (var_1_11 / var_1_33)) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L108] COND TRUE \read(var_1_17) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L109] COND TRUE (var_1_13 * var_1_6) == var_1_5 [L110] var_1_32 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L122] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L127] COND TRUE ((((var_1_11) < (var_1_33)) ? (var_1_11) : (var_1_33))) < (var_1_39 + var_1_12) [L128] var_1_43 = ((((var_1_11) < ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) ? (var_1_11) : ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=8589934592, var_1_47=0, var_1_8=0] [L130] var_1_47 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=8589934592, var_1_47=8589934592, var_1_8=0] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=8589934592, var_1_47=8589934592, var_1_8=0] [L177-L178] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=8589934592, var_1_47=8589934592, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=8589934592, var_1_47=8589934592, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 9, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1931 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1831 mSDsluCounter, 3836 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2665 mSDsCounter, 608 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2602 IncrementalHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 608 mSolverCounterUnsat, 1171 mSDtfsCounter, 2602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1704 GetRequests, 1585 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1053occurred in iteration=7, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 837 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2460 NumberOfCodeBlocks, 2460 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2269 ConstructedInterpolants, 0 QuantifiedInterpolants, 6734 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1604 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 16468/16900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 13:48:32,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:48:33,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:48:33,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:48:33,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:48:33,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:48:33,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:48:33,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:48:33,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:48:33,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:48:33,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:48:33,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:48:33,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:48:33,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:48:33,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:48:33,979 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:48:33,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:48:33,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:48:33,979 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:48:33,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:48:33,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:48:33,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:48:33,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:48:33,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:48:33,981 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:48:33,982 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:48:33,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:48:33,982 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:48:33,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:48:33,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:48:33,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:48:33,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:48:33,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:48:33,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:48:33,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:48:33,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:48:33,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:48:33,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:48:33,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:48:33,985 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:48:33,985 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:48:33,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:48:33,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:48:33,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:48:33,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:48:33,986 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 [2024-11-16 13:48:34,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:48:34,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:48:34,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:48:34,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:48:34,238 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:48:34,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-16 13:48:35,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:48:35,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:48:35,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-16 13:48:35,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db94559f/c31c4333f3534b03a17569dae5422f6a/FLAG750d8d9f7 [2024-11-16 13:48:35,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db94559f/c31c4333f3534b03a17569dae5422f6a [2024-11-16 13:48:35,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:48:35,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:48:35,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:48:35,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:48:35,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:48:35,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:48:35" (1/1) ... [2024-11-16 13:48:35,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6fa202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:35, skipping insertion in model container [2024-11-16 13:48:35,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:48:35" (1/1) ... [2024-11-16 13:48:35,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:48:35,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2024-11-16 13:48:36,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:48:36,020 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:48:36,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2024-11-16 13:48:36,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:48:36,088 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:48:36,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36 WrapperNode [2024-11-16 13:48:36,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:48:36,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:48:36,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:48:36,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:48:36,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,141 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-16 13:48:36,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:48:36,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:48:36,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:48:36,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:48:36,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 13:48:36,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:48:36,192 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:48:36,192 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:48:36,193 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:48:36,193 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:48:36,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:48:36,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 13:48:36,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 13:48:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:48:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:48:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:48:36,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:48:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:48:36,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:48:36,352 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:48:36,354 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:48:40,707 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 13:48:40,707 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:48:40,719 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:48:40,719 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:48:40,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:48:40 BoogieIcfgContainer [2024-11-16 13:48:40,719 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:48:40,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:48:40,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:48:40,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:48:40,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:48:35" (1/3) ... [2024-11-16 13:48:40,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40097a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:48:40, skipping insertion in model container [2024-11-16 13:48:40,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36" (2/3) ... [2024-11-16 13:48:40,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40097a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:48:40, skipping insertion in model container [2024-11-16 13:48:40,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:48:40" (3/3) ... [2024-11-16 13:48:40,724 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-16 13:48:40,737 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:48:40,737 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:48:40,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:48:40,787 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c070108, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:48:40,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:48:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 13:48:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 13:48:40,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:40,801 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:40,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:40,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:40,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1073377167, now seen corresponding path program 1 times [2024-11-16 13:48:40,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:48:40,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473362700] [2024-11-16 13:48:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:40,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:48:40,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:48:40,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:48:40,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 13:48:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:41,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:48:41,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-16 13:48:41,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:48:41,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:48:41,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473362700] [2024-11-16 13:48:41,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473362700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:48:41,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:48:41,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:48:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350598452] [2024-11-16 13:48:41,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:48:41,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:48:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:48:41,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:48:41,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:48:41,295 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 13:48:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:41,323 INFO L93 Difference]: Finished difference Result 166 states and 289 transitions. [2024-11-16 13:48:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:48:41,324 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-16 13:48:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:41,329 INFO L225 Difference]: With dead ends: 166 [2024-11-16 13:48:41,330 INFO L226 Difference]: Without dead ends: 82 [2024-11-16 13:48:41,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:48:41,334 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:41,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:48:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-16 13:48:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-16 13:48:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 13:48:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-11-16 13:48:41,366 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 171 [2024-11-16 13:48:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:41,366 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-11-16 13:48:41,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 13:48:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-11-16 13:48:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 13:48:41,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:41,369 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:41,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 13:48:41,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:48:41,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:41,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:41,571 INFO L85 PathProgramCache]: Analyzing trace with hash 85705941, now seen corresponding path program 1 times [2024-11-16 13:48:41,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:48:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722270503] [2024-11-16 13:48:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:41,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:48:41,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:48:41,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:48:41,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 13:48:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:41,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 13:48:41,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-11-16 13:48:42,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:48:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 13:48:42,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:48:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722270503] [2024-11-16 13:48:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722270503] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 13:48:42,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 13:48:42,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-16 13:48:42,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727805532] [2024-11-16 13:48:42,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:48:42,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:48:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:48:42,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:48:42,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:48:42,821 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 13:48:45,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:48:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:45,769 INFO L93 Difference]: Finished difference Result 165 states and 248 transitions. [2024-11-16 13:48:45,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:48:45,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-16 13:48:45,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:45,797 INFO L225 Difference]: With dead ends: 165 [2024-11-16 13:48:45,797 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 13:48:45,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:48:45,799 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 74 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:45,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 150 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-16 13:48:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 13:48:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-16 13:48:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 13:48:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-11-16 13:48:45,811 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 171 [2024-11-16 13:48:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:45,811 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-11-16 13:48:45,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 13:48:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-11-16 13:48:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 13:48:45,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:45,818 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:45,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 13:48:46,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:48:46,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:46,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:46,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1020599346, now seen corresponding path program 1 times [2024-11-16 13:48:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:48:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933938335] [2024-11-16 13:48:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:46,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:48:46,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:48:46,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:48:46,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 13:48:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:46,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:48:46,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 13:48:47,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:48:47,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:48:47,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933938335] [2024-11-16 13:48:47,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933938335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:48:47,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:48:47,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:48:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80007702] [2024-11-16 13:48:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:48:47,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:48:47,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:48:47,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:48:47,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:48:47,060 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 13:48:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:48,135 INFO L93 Difference]: Finished difference Result 252 states and 372 transitions. [2024-11-16 13:48:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:48:48,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-16 13:48:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:48,164 INFO L225 Difference]: With dead ends: 252 [2024-11-16 13:48:48,164 INFO L226 Difference]: Without dead ends: 169 [2024-11-16 13:48:48,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:48:48,169 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 37 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:48,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 261 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 13:48:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-16 13:48:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2024-11-16 13:48:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.280373831775701) internal successors, (137), 107 states have internal predecessors, (137), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 13:48:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 241 transitions. [2024-11-16 13:48:48,191 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 241 transitions. Word has length 172 [2024-11-16 13:48:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:48,192 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 241 transitions. [2024-11-16 13:48:48,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 13:48:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2024-11-16 13:48:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 13:48:48,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:48,194 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:48,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 13:48:48,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:48:48,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1014189111, now seen corresponding path program 1 times [2024-11-16 13:48:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:48:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627328378] [2024-11-16 13:48:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:48,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:48:48,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:48:48,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:48:48,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 13:48:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:48,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 13:48:48,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2024-11-16 13:48:49,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:48:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2024-11-16 13:48:50,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:48:50,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627328378] [2024-11-16 13:48:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627328378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:48:50,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:48:50,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2024-11-16 13:48:50,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385613346] [2024-11-16 13:48:50,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:48:50,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 13:48:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:48:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 13:48:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-16 13:48:50,884 INFO L87 Difference]: Start difference. First operand 164 states and 241 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-16 13:48:54,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:48:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:55,938 INFO L93 Difference]: Finished difference Result 501 states and 701 transitions. [2024-11-16 13:48:55,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-16 13:48:55,938 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 173 [2024-11-16 13:48:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:55,941 INFO L225 Difference]: With dead ends: 501 [2024-11-16 13:48:55,941 INFO L226 Difference]: Without dead ends: 340 [2024-11-16 13:48:55,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=589, Invalid=1573, Unknown=0, NotChecked=0, Total=2162 [2024-11-16 13:48:55,946 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 521 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:55,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 498 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-16 13:48:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-16 13:48:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 304. [2024-11-16 13:48:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 197 states have (on average 1.2030456852791878) internal successors, (237), 198 states have internal predecessors, (237), 90 states have call successors, (90), 16 states have call predecessors, (90), 16 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-16 13:48:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 417 transitions. [2024-11-16 13:48:55,984 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 417 transitions. Word has length 173 [2024-11-16 13:48:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:55,985 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 417 transitions. [2024-11-16 13:48:55,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-16 13:48:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 417 transitions. [2024-11-16 13:48:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 13:48:55,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:55,988 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:56,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 13:48:56,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:48:56,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:56,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1318093115, now seen corresponding path program 1 times [2024-11-16 13:48:56,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:48:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002949796] [2024-11-16 13:48:56,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:56,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:48:56,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:48:56,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:48:56,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 13:48:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:56,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 13:48:56,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-16 13:48:57,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:48:57,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:48:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002949796] [2024-11-16 13:48:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002949796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:48:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1458347439] [2024-11-16 13:48:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:57,686 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 13:48:57,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 13:48:57,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 13:48:57,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-16 13:48:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:58,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 13:48:58,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-16 13:48:58,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:48:59,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1458347439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:48:59,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:48:59,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-16 13:48:59,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203239203] [2024-11-16 13:48:59,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:48:59,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 13:48:59,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:48:59,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 13:48:59,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 13:48:59,254 INFO L87 Difference]: Start difference. First operand 304 states and 417 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 13:49:04,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:49:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:49:04,500 INFO L93 Difference]: Finished difference Result 632 states and 837 transitions. [2024-11-16 13:49:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 13:49:04,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 173 [2024-11-16 13:49:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:49:04,532 INFO L225 Difference]: With dead ends: 632 [2024-11-16 13:49:04,532 INFO L226 Difference]: Without dead ends: 357 [2024-11-16 13:49:04,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-16 13:49:04,533 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 53 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:49:04,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 190 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-16 13:49:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-16 13:49:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 329. [2024-11-16 13:49:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 215 states have (on average 1.158139534883721) internal successors, (249), 216 states have internal predecessors, (249), 90 states have call successors, (90), 23 states have call predecessors, (90), 23 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-16 13:49:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 429 transitions. [2024-11-16 13:49:04,556 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 429 transitions. Word has length 173 [2024-11-16 13:49:04,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:49:04,557 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 429 transitions. [2024-11-16 13:49:04,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 13:49:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 429 transitions. [2024-11-16 13:49:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 13:49:04,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:49:04,558 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:49:04,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-16 13:49:04,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-16 13:49:04,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:49:04,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:49:04,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:49:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1715925110, now seen corresponding path program 1 times [2024-11-16 13:49:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:49:04,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526855954] [2024-11-16 13:49:04,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:49:04,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:49:04,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:49:04,962 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:49:04,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-16 13:49:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:49:05,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 13:49:05,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:49:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 514 proven. 108 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-16 13:49:22,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:49:42,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:49:42,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526855954] [2024-11-16 13:49:42,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526855954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:49:42,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1588276044] [2024-11-16 13:49:42,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:49:42,172 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 13:49:42,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 13:49:42,173 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 13:49:42,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-16 13:49:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:49:43,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 13:49:43,103 INFO L278 TraceCheckSpWp]: Computing forward predicates...