./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-91.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4a8cea677bb0034758c0b971bd4c7584ef85964d8ea38e677cb6123f96d842fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:27:07,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:27:07,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:27:07,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:27:07,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:27:07,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:27:07,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:27:07,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:27:07,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:27:07,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:27:07,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:27:07,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:27:07,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:27:07,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:27:07,974 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:27:07,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:27:07,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:27:07,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:27:07,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:27:07,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:27:07,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:27:07,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:27:07,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:27:07,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:27:07,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:27:07,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:27:07,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:27:07,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:27:07,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:27:07,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:27:07,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:27:07,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:27:07,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:27:07,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:27:07,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:27:07,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:27:07,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:27:07,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:27:07,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:27:07,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:27:07,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:27:07,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:27:07,980 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-clean/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-clean/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 -> 4a8cea677bb0034758c0b971bd4c7584ef85964d8ea38e677cb6123f96d842fc [2024-10-11 07:27:08,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:27:08,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:27:08,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:27:08,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:27:08,220 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:27:08,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-91.i [2024-10-11 07:27:09,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:27:09,671 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:27:09,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-91.i [2024-10-11 07:27:09,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7eaf35648/585970f985824835b1ce71ca178398d4/FLAG2c7a54687 [2024-10-11 07:27:10,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7eaf35648/585970f985824835b1ce71ca178398d4 [2024-10-11 07:27:10,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:27:10,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:27:10,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:27:10,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:27:10,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:27:10,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e90ebe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10, skipping insertion in model container [2024-10-11 07:27:10,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:27:10,236 WARN L248 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_codestructure_normal_file-91.i[913,926] [2024-10-11 07:27:10,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:27:10,313 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:27:10,322 WARN L248 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_codestructure_normal_file-91.i[913,926] [2024-10-11 07:27:10,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:27:10,364 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:27:10,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10 WrapperNode [2024-10-11 07:27:10,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:27:10,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:27:10,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:27:10,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:27:10,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,405 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-11 07:27:10,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:27:10,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:27:10,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:27:10,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:27:10,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,433 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-10-11 07:27:10,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:27:10,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:27:10,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:27:10,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:27:10,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (1/1) ... [2024-10-11 07:27:10,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:27:10,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:27:10,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:27:10,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:27:10,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:27:10,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:27:10,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:27:10,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:27:10,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:27:10,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:27:10,607 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:27:10,609 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:27:10,970 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:27:10,971 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:27:11,020 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:27:11,020 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:27:11,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:27:11 BoogieIcfgContainer [2024-10-11 07:27:11,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:27:11,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:27:11,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:27:11,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:27:11,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:27:10" (1/3) ... [2024-10-11 07:27:11,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd71ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:27:11, skipping insertion in model container [2024-10-11 07:27:11,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:10" (2/3) ... [2024-10-11 07:27:11,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd71ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:27:11, skipping insertion in model container [2024-10-11 07:27:11,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:27:11" (3/3) ... [2024-10-11 07:27:11,027 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-91.i [2024-10-11 07:27:11,039 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:27:11,039 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:27:11,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:27:11,087 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;@38f241dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:27:11,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:27:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:27:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 07:27:11,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:27:11,103 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:27:11,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:27:11,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:27:11,109 INFO L85 PathProgramCache]: Analyzing trace with hash 888244464, now seen corresponding path program 1 times [2024-10-11 07:27:11,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:27:11,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775845163] [2024-10-11 07:27:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:27:11,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:27:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:27:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:27:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:27:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:27:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:27:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:27:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:27:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:27:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:27:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:27:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:27:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:27:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:27:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:27:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:27:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:27:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:27:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:27:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:27:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:27:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 07:27:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:27:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 07:27:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:27:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 07:27:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:27:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 07:27:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 07:27:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 07:27:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 07:27:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 07:27:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 07:27:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 07:27:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 07:27:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 07:27:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:27:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775845163] [2024-10-11 07:27:11,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775845163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:27:11,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:27:11,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:27:11,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865016018] [2024-10-11 07:27:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:27:11,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:27:11,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:27:11,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:27:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:27:11,486 INFO L87 Difference]: Start difference. First operand has 75 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 07:27:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:27:11,522 INFO L93 Difference]: Finished difference Result 147 states and 274 transitions. [2024-10-11 07:27:11,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:27:11,524 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 199 [2024-10-11 07:27:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:27:11,529 INFO L225 Difference]: With dead ends: 147 [2024-10-11 07:27:11,529 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 07:27:11,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-10-11 07:27:11,534 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:27:11,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:27:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 07:27:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 07:27:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:27:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2024-10-11 07:27:11,580 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 199 [2024-10-11 07:27:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:27:11,581 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2024-10-11 07:27:11,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 07:27:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2024-10-11 07:27:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 07:27:11,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:27:11,586 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:27:11,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:27:11,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:27:11,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:27:11,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1436714408, now seen corresponding path program 1 times [2024-10-11 07:27:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:27:11,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412127021] [2024-10-11 07:27:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:27:11,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:27:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:27:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:27:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:27:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:27:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:27:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:27:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:27:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:27:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:27:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:27:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:27:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:27:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:27:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:27:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:27:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:27:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:27:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:27:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:27:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:27:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 07:27:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:27:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 07:27:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:27:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 07:27:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:27:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 07:27:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 07:27:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 07:27:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 07:27:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 07:27:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 07:27:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 07:27:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 07:27:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 07:27:11,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:27:11,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412127021] [2024-10-11 07:27:11,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412127021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:27:11,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:27:11,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:27:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498851500] [2024-10-11 07:27:11,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:27:11,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:27:11,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:27:11,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:27:11,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:27:11,838 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 07:27:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:27:11,885 INFO L93 Difference]: Finished difference Result 181 states and 285 transitions. [2024-10-11 07:27:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:27:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 199 [2024-10-11 07:27:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:27:11,888 INFO L225 Difference]: With dead ends: 181 [2024-10-11 07:27:11,888 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 07:27:11,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-10-11 07:27:11,889 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 51 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:27:11,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 255 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:27:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 07:27:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-10-11 07:27:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 55 states have (on average 1.290909090909091) internal successors, (71), 56 states have internal predecessors, (71), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 07:27:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-10-11 07:27:11,917 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 199 [2024-10-11 07:27:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:27:11,918 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-10-11 07:27:11,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 07:27:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-10-11 07:27:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 07:27:11,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:27:11,923 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:27:11,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:27:11,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:27:11,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:27:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1577843181, now seen corresponding path program 1 times [2024-10-11 07:27:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:27:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891754863] [2024-10-11 07:27:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:27:11,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:27:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:27:12,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1442080560] [2024-10-11 07:27:12,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:27:12,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:27:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:27:12,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:27:12,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:27:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:27:12,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:27:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:27:12,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:27:12,398 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:27:12,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:27:12,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:27:12,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:27:12,607 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 07:27:12,709 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:27:12,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:27:12 BoogieIcfgContainer [2024-10-11 07:27:12,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:27:12,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:27:12,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:27:12,713 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:27:12,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:27:11" (3/4) ... [2024-10-11 07:27:12,715 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:27:12,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:27:12,716 INFO L158 Benchmark]: Toolchain (without parser) took 2649.85ms. Allocated memory is still 159.4MB. Free memory was 91.6MB in the beginning and 93.0MB in the end (delta: -1.4MB). Peak memory consumption was 463.3kB. Max. memory is 16.1GB. [2024-10-11 07:27:12,716 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 78.8MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:27:12,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.77ms. Allocated memory is still 159.4MB. Free memory was 91.6MB in the beginning and 76.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:27:12,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.76ms. Allocated memory is still 159.4MB. Free memory was 76.1MB in the beginning and 73.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:27:12,717 INFO L158 Benchmark]: Boogie Preprocessor took 43.21ms. Allocated memory is still 159.4MB. Free memory was 73.1MB in the beginning and 69.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:27:12,719 INFO L158 Benchmark]: RCFGBuilder took 568.88ms. Allocated memory is still 159.4MB. Free memory was 69.8MB in the beginning and 115.9MB in the end (delta: -46.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-10-11 07:27:12,720 INFO L158 Benchmark]: TraceAbstraction took 1689.56ms. Allocated memory is still 159.4MB. Free memory was 115.9MB in the beginning and 94.0MB in the end (delta: 21.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-11 07:27:12,720 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 159.4MB. Free memory was 94.0MB in the beginning and 93.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:27:12,721 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.68ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 78.8MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.77ms. Allocated memory is still 159.4MB. Free memory was 91.6MB in the beginning and 76.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.76ms. Allocated memory is still 159.4MB. Free memory was 76.1MB in the beginning and 73.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.21ms. Allocated memory is still 159.4MB. Free memory was 73.1MB in the beginning and 69.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 568.88ms. Allocated memory is still 159.4MB. Free memory was 69.8MB in the beginning and 115.9MB in the end (delta: -46.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1689.56ms. Allocated memory is still 159.4MB. Free memory was 115.9MB in the beginning and 94.0MB in the end (delta: 21.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 159.4MB. Free memory was 94.0MB in the beginning and 93.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 149, overapproximation of someBinaryArithmeticFLOAToperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -64; [L23] signed char var_1_2 = -128; [L24] signed char var_1_3 = -8; [L25] signed char var_1_4 = 4; [L26] signed short int var_1_5 = 8; [L27] signed short int var_1_6 = 8; [L28] signed short int var_1_7 = 5; [L29] signed short int var_1_8 = 0; [L30] signed char var_1_9 = 5; [L31] unsigned char var_1_10 = 0; [L32] signed char var_1_11 = 16; [L33] signed short int var_1_12 = 25; [L34] signed short int var_1_13 = 64; [L35] signed long int var_1_14 = -64; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 16; [L38] float var_1_17 = 1.2; [L39] float var_1_18 = 5.8; [L40] float var_1_19 = 10.25; [L41] float var_1_20 = 2.5; [L42] signed short int var_1_21 = 200; [L43] unsigned char var_1_22 = 1; [L44] unsigned char var_1_23 = 1; [L45] unsigned char var_1_24 = 1; [L46] unsigned char var_1_25 = 0; [L47] signed char var_1_26 = -5; [L153] isInitial = 1 [L154] FCALL initially() [L155] COND TRUE 1 [L156] FCALL updateLastVariables() [L157] CALL updateVariables() [L93] var_1_2 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=-8, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=-8, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L94] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=-8, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L95] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=-8, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=-8, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L95] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=-8, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] var_1_3 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L97] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L98] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L98] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=4, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L99] var_1_4 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L100] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L101] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L102] var_1_5 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L103] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L104] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L104] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L105] var_1_6 = __VERIFIER_nondet_short() [L106] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L106] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L107] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L107] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L108] var_1_7 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L109] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L110] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L110] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] var_1_8 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L113] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L113] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L114] var_1_10 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L116] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L116] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=16, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L117] var_1_11 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L118] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L119] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L119] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=25, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L120] var_1_12 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L121] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L122] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L122] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L123] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L123] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=-64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] var_1_14 = __VERIFIER_nondet_long() [L125] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L125] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L126] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L126] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L127] var_1_16 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L128] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L129] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L129] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L130] var_1_18 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L131] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L132] var_1_19 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L133] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L134] var_1_20 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L135] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L136] var_1_22 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L137] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L138] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L138] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L139] var_1_23 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L140] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L141] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L141] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L142] var_1_25 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L143] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L144] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L144] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L157] RET updateVariables() [L158] CALL step() [L51] COND FALSE !(var_1_2 == var_1_3) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L58] COND TRUE \read(var_1_10) [L59] var_1_9 = var_1_11 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L67] COND FALSE !((- var_1_5) >= (var_1_4 * (var_1_14 % var_1_12))) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L70] COND FALSE !(var_1_11 < var_1_2) [L77] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L79] COND TRUE var_1_11 < 5 [L80] var_1_17 = ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L82] COND TRUE \read(var_1_10) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L83] COND TRUE var_1_22 && var_1_23 [L84] var_1_21 = var_1_3 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=1, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L89] var_1_24 = var_1_25 [L90] var_1_26 = var_1_11 [L158] RET step() [L159] CALL, EXPR property() [L149-L150] return ((((((((var_1_2 == var_1_3) ? ((var_1_3 <= ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) ? (var_1_1 == ((signed short int) (var_1_3 + (((((var_1_5 - var_1_6)) < ((var_1_7 - var_1_8))) ? ((var_1_5 - var_1_6)) : ((var_1_7 - var_1_8))))))) : (var_1_1 == ((signed short int) (((((var_1_8 - var_1_6)) < (((var_1_7 - var_1_5) + -256))) ? ((var_1_8 - var_1_6)) : (((var_1_7 - var_1_5) + -256))))))) : 1) && (var_1_10 ? (var_1_9 == ((signed char) var_1_11)) : ((var_1_7 <= (var_1_3 / var_1_12)) ? (var_1_9 == ((signed char) var_1_11)) : (var_1_9 == ((signed char) var_1_11))))) && (((- var_1_5) >= (var_1_4 * (var_1_14 % var_1_12))) ? (var_1_13 == ((signed short int) var_1_2)) : 1)) && ((var_1_11 < var_1_2) ? ((var_1_7 == ((var_1_6 + var_1_8) - var_1_5)) ? (var_1_15 == ((unsigned char) var_1_16)) : (var_1_15 == ((unsigned char) var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && ((var_1_11 < 5) ? (var_1_17 == ((float) ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))))) : 1)) && (var_1_10 ? ((var_1_22 && var_1_23) ? (var_1_21 == ((signed short int) var_1_3)) : 1) : (var_1_21 == ((signed short int) (var_1_7 - 2))))) && (var_1_24 == ((unsigned char) var_1_25))) && (var_1_26 == ((signed char) var_1_11)) ; [L159] RET, EXPR property() [L159] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=1, var_1_22=1, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=1, var_1_22=1, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 368 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 263 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4488/4488 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-10-11 07:27:12,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-91.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4a8cea677bb0034758c0b971bd4c7584ef85964d8ea38e677cb6123f96d842fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:27:14,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:27:14,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:27:14,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:27:14,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:27:14,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:27:14,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:27:14,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:27:14,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:27:14,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:27:14,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:27:14,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:27:14,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:27:14,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:27:14,604 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:27:14,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:27:14,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:27:14,605 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:27:14,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:27:14,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:27:14,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:27:14,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:27:14,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:27:14,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:27:14,608 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:27:14,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:27:14,608 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:27:14,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:27:14,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:27:14,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:27:14,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:27:14,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:27:14,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:27:14,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:27:14,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:27:14,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:27:14,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:27:14,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:27:14,611 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:27:14,611 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:27:14,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:27:14,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:27:14,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:27:14,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:27:14,612 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:27:14,612 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-clean/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-clean/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 -> 4a8cea677bb0034758c0b971bd4c7584ef85964d8ea38e677cb6123f96d842fc [2024-10-11 07:27:14,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:27:14,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:27:14,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:27:14,897 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:27:14,897 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:27:14,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-91.i [2024-10-11 07:27:16,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:27:16,414 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:27:16,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-91.i [2024-10-11 07:27:16,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b297a35a9/e4f5388809fe498f9f6723b773da826f/FLAG4c3860ddd [2024-10-11 07:27:16,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b297a35a9/e4f5388809fe498f9f6723b773da826f [2024-10-11 07:27:16,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:27:16,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:27:16,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:27:16,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:27:16,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:27:16,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:27:16" (1/1) ... [2024-10-11 07:27:16,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61862fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:16, skipping insertion in model container [2024-10-11 07:27:16,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:27:16" (1/1) ... [2024-10-11 07:27:16,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:27:16,988 WARN L248 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_codestructure_normal_file-91.i[913,926] [2024-10-11 07:27:17,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:27:17,098 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:27:17,108 WARN L248 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_codestructure_normal_file-91.i[913,926] [2024-10-11 07:27:17,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:27:17,165 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:27:17,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17 WrapperNode [2024-10-11 07:27:17,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:27:17,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:27:17,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:27:17,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:27:17,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,217 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-10-11 07:27:17,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:27:17,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:27:17,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:27:17,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:27:17,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,256 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-10-11 07:27:17,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:27:17,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:27:17,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:27:17,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:27:17,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (1/1) ... [2024-10-11 07:27:17,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:27:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:27:17,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:27:17,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:27:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:27:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:27:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:27:17,336 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:27:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:27:17,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:27:17,397 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:27:17,399 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:27:17,857 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:27:17,857 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:27:17,909 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:27:17,909 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:27:17,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:27:17 BoogieIcfgContainer [2024-10-11 07:27:17,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:27:17,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:27:17,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:27:17,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:27:17,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:27:16" (1/3) ... [2024-10-11 07:27:17,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df32ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:27:17, skipping insertion in model container [2024-10-11 07:27:17,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:27:17" (2/3) ... [2024-10-11 07:27:17,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df32ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:27:17, skipping insertion in model container [2024-10-11 07:27:17,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:27:17" (3/3) ... [2024-10-11 07:27:17,920 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-91.i [2024-10-11 07:27:17,933 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:27:17,933 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:27:17,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:27:18,000 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;@167743e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:27:18,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:27:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:27:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 07:27:18,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:27:18,020 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:27:18,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:27:18,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:27:18,026 INFO L85 PathProgramCache]: Analyzing trace with hash 888244464, now seen corresponding path program 1 times [2024-10-11 07:27:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:27:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240195590] [2024-10-11 07:27:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:27:18,038 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-10-11 07:27:18,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:27:18,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 07:27:18,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:27:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:18,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:27:18,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:27:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1074 proven. 0 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2024-10-11 07:27:18,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:27:18,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:27:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240195590] [2024-10-11 07:27:18,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240195590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:27:18,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:27:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:27:18,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553635735] [2024-10-11 07:27:18,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:27:18,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:27:18,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:27:18,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:27:18,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:27:18,510 INFO L87 Difference]: Start difference. First operand has 75 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 07:27:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:27:18,644 INFO L93 Difference]: Finished difference Result 147 states and 274 transitions. [2024-10-11 07:27:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:27:18,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 199 [2024-10-11 07:27:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:27:18,660 INFO L225 Difference]: With dead ends: 147 [2024-10-11 07:27:18,660 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 07:27:18,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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-10-11 07:27:18,666 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:27:18,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:27:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 07:27:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 07:27:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:27:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2024-10-11 07:27:18,704 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 199 [2024-10-11 07:27:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:27:18,708 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2024-10-11 07:27:18,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 07:27:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2024-10-11 07:27:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 07:27:18,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:27:18,714 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:27:18,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:27:18,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 07:27:18,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:27:18,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:27:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1436714408, now seen corresponding path program 1 times [2024-10-11 07:27:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:27:18,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937433342] [2024-10-11 07:27:18,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:27:18,918 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-10-11 07:27:18,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:27:18,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 07:27:18,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:27:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:19,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:27:19,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:27:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 07:27:19,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:27:19,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:27:19,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937433342] [2024-10-11 07:27:19,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937433342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:27:19,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:27:19,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:27:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447196506] [2024-10-11 07:27:19,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:27:19,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:27:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:27:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:27:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:27:19,206 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 07:27:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:27:19,452 INFO L93 Difference]: Finished difference Result 181 states and 285 transitions. [2024-10-11 07:27:19,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:27:19,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 199 [2024-10-11 07:27:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:27:19,456 INFO L225 Difference]: With dead ends: 181 [2024-10-11 07:27:19,456 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 07:27:19,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 197 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-10-11 07:27:19,461 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 51 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:27:19,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 254 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:27:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 07:27:19,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-10-11 07:27:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 55 states have (on average 1.290909090909091) internal successors, (71), 56 states have internal predecessors, (71), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 07:27:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-10-11 07:27:19,495 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 199 [2024-10-11 07:27:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:27:19,498 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-10-11 07:27:19,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 07:27:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-10-11 07:27:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 07:27:19,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:27:19,500 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:27:19,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:27:19,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 07:27:19,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:27:19,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:27:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1577843181, now seen corresponding path program 1 times [2024-10-11 07:27:19,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:27:19,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993804157] [2024-10-11 07:27:19,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:27:19,705 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-10-11 07:27:19,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:27:19,708 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 07:27:19,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:27:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:27:19,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 07:27:19,912 INFO L278 TraceCheckSpWp]: Computing forward predicates...