./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f78f07977a6a6c060ce47508f319b35375a64382f2792ef417cdb466597e7230 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:31:07,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:31:07,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:31:07,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:31:07,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:31:07,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:31:07,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:31:07,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:31:07,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:31:07,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:31:07,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:31:07,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:31:07,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:31:07,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:31:07,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:31:07,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:31:07,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:31:07,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:31:07,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:31:07,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:31:07,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:31:07,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:31:07,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:31:07,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:31:07,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:31:07,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:31:07,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:31:07,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:31:07,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:31:07,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:31:07,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:31:07,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:31:07,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:31:07,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:31:07,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:31:07,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:31:07,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:31:07,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:31:07,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:31:07,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:31:07,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:31:07,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:31:07,192 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f78f07977a6a6c060ce47508f319b35375a64382f2792ef417cdb466597e7230 [2024-11-09 00:31:07,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:31:07,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:31:07,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:31:07,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:31:07,522 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:31:07,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i [2024-11-09 00:31:09,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:31:09,285 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:31:09,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i [2024-11-09 00:31:09,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c400945f/752fd44fd3734ff3bbedbb25de652fa9/FLAGeac383b49 [2024-11-09 00:31:09,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c400945f/752fd44fd3734ff3bbedbb25de652fa9 [2024-11-09 00:31:09,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:31:09,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:31:09,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:09,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:31:09,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:31:09,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1c77d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09, skipping insertion in model container [2024-11-09 00:31:09,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:31:09,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i[916,929] [2024-11-09 00:31:09,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:09,621 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:31:09,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i[916,929] [2024-11-09 00:31:09,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:09,702 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:31:09,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09 WrapperNode [2024-11-09 00:31:09,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:09,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:09,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:31:09,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:31:09,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,765 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-09 00:31:09,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:09,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:31:09,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:31:09,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:31:09,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,807 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:31:09,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:31:09,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:31:09,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:31:09,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:31:09,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:31:09,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:09,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:31:09,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:31:09,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:31:09,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:31:09,949 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:31:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:31:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:31:09,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:31:10,074 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:31:10,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:31:10,497 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 00:31:10,498 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:31:10,519 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:31:10,519 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:31:10,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:10 BoogieIcfgContainer [2024-11-09 00:31:10,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:31:10,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:31:10,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:31:10,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:31:10,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:31:09" (1/3) ... [2024-11-09 00:31:10,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a287e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:31:10, skipping insertion in model container [2024-11-09 00:31:10,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (2/3) ... [2024-11-09 00:31:10,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a287e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:31:10, skipping insertion in model container [2024-11-09 00:31:10,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:10" (3/3) ... [2024-11-09 00:31:10,531 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-97.i [2024-11-09 00:31:10,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:31:10,549 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:31:10,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:31:10,634 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;@53bffbd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:31:10,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:31:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:31:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:31:10,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:10,655 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:31:10,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:10,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:10,662 INFO L85 PathProgramCache]: Analyzing trace with hash -526305821, now seen corresponding path program 1 times [2024-11-09 00:31:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:10,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303144220] [2024-11-09 00:31:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:10,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:31:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:31:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:31:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:31:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:31:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:31:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:31:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:31:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:31:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:31:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:31:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:31:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:31:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:31:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:31:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:31:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:31:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:31:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:31:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:31:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:31:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:31:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:31:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:31:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:31:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:11,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303144220] [2024-11-09 00:31:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303144220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:31:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:31:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:31:11,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892781841] [2024-11-09 00:31:11,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:31:11,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:31:11,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:11,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:31:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:31:11,235 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:31:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:11,274 INFO L93 Difference]: Finished difference Result 155 states and 272 transitions. [2024-11-09 00:31:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:31:11,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-09 00:31:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:11,288 INFO L225 Difference]: With dead ends: 155 [2024-11-09 00:31:11,289 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 00:31:11,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:31:11,299 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:11,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:31:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 00:31:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 00:31:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:31:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-11-09 00:31:11,393 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 159 [2024-11-09 00:31:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:11,400 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-11-09 00:31:11,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:31:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-11-09 00:31:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:31:11,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:11,410 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:31:11,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:31:11,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:11,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -179999509, now seen corresponding path program 1 times [2024-11-09 00:31:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:11,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472032638] [2024-11-09 00:31:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:11,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:31:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:31:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:31:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:31:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:31:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:31:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:31:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:31:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:31:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:31:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:31:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:31:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:31:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:31:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:31:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:31:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:31:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:31:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:31:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:31:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:31:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:31:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:31:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:31:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:31:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:11,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472032638] [2024-11-09 00:31:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472032638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:31:11,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:31:11,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:31:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284811110] [2024-11-09 00:31:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:31:11,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:31:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:31:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:31:11,895 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:31:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:11,984 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2024-11-09 00:31:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:31:11,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-09 00:31:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:11,990 INFO L225 Difference]: With dead ends: 216 [2024-11-09 00:31:11,992 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 00:31:11,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:31:11,996 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 96 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:11,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 300 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:31:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 00:31:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2024-11-09 00:31:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:31:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-11-09 00:31:12,022 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 159 [2024-11-09 00:31:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:12,026 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-11-09 00:31:12,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:31:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-11-09 00:31:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:31:12,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:12,033 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:31:12,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:31:12,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:12,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash 69351161, now seen corresponding path program 1 times [2024-11-09 00:31:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:12,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037729927] [2024-11-09 00:31:12,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:31:12,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962897394] [2024-11-09 00:31:12,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:12,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:12,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:12,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:31:12,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:31:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 00:31:13,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 515 proven. 150 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-09 00:31:14,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:31:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:15,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037729927] [2024-11-09 00:31:15,839 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 00:31:15,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962897394] [2024-11-09 00:31:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962897394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:31:15,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:31:15,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-09 00:31:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406038165] [2024-11-09 00:31:15,840 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 00:31:15,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 00:31:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:15,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 00:31:15,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2024-11-09 00:31:15,843 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-09 00:31:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:17,609 INFO L93 Difference]: Finished difference Result 354 states and 504 transitions. [2024-11-09 00:31:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-09 00:31:17,609 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) Word has length 159 [2024-11-09 00:31:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:17,614 INFO L225 Difference]: With dead ends: 354 [2024-11-09 00:31:17,616 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 00:31:17,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1125, Invalid=3297, Unknown=0, NotChecked=0, Total=4422 [2024-11-09 00:31:17,620 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 543 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:17,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 457 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 00:31:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 00:31:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 119. [2024-11-09 00:31:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:31:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2024-11-09 00:31:17,653 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 159 [2024-11-09 00:31:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:17,656 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2024-11-09 00:31:17,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-09 00:31:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2024-11-09 00:31:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 00:31:17,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:17,662 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:31:17,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:31:17,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:17,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:17,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1795679469, now seen corresponding path program 1 times [2024-11-09 00:31:17,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:17,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006013019] [2024-11-09 00:31:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:31:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:31:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:31:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:31:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:31:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:31:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:31:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:31:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:31:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:31:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:31:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:31:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:31:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:31:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:31:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:31:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:31:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:31:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:31:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:31:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:31:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:31:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:31:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:31:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-09 00:31:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006013019] [2024-11-09 00:31:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006013019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:31:18,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577789700] [2024-11-09 00:31:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:18,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:18,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:18,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:31:18,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:31:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 00:31:18,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-09 00:31:19,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:31:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-09 00:31:19,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577789700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:31:19,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:31:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 10 [2024-11-09 00:31:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079066720] [2024-11-09 00:31:19,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:31:19,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 00:31:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 00:31:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:31:19,234 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-09 00:31:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:19,787 INFO L93 Difference]: Finished difference Result 312 states and 421 transitions. [2024-11-09 00:31:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 00:31:19,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 160 [2024-11-09 00:31:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:19,791 INFO L225 Difference]: With dead ends: 312 [2024-11-09 00:31:19,793 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 00:31:19,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-11-09 00:31:19,795 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 191 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:19,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 417 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:31:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 00:31:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 107. [2024-11-09 00:31:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:31:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2024-11-09 00:31:19,828 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 160 [2024-11-09 00:31:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:19,830 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2024-11-09 00:31:19,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-09 00:31:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2024-11-09 00:31:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 00:31:19,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:19,832 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:31:19,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:31:20,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 00:31:20,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:20,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1546328799, now seen corresponding path program 1 times [2024-11-09 00:31:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:20,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950511831] [2024-11-09 00:31:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:20,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:31:20,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763429569] [2024-11-09 00:31:20,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:20,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:20,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:20,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:31:20,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 00:31:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:21,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 00:31:21,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 728 proven. 111 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-09 00:31:21,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:31:26,089 WARN L851 $PredicateComparison]: unable to prove that (and (= (mod c_~var_1_23~0 256) 0) (forall ((v_z_13 Int)) (or (< (mod (div v_z_13 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_13) (< 65535 v_z_13) (< v_z_13 (mod |c_ULTIMATE.start_step_~stepLocal_6~0#1| 256))))) is different from false [2024-11-09 00:31:30,275 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_z_13 Int)) (or (< (mod (div v_z_13 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_13) (< 65535 v_z_13) (< v_z_13 (mod c_~var_1_14~0 256)))) (= (mod c_~var_1_23~0 256) 0)) is different from false [2024-11-09 00:31:34,627 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_z_13 Int)) (or (< (mod (div v_z_13 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_13) (< 65535 v_z_13) (< v_z_13 (mod c_~var_1_14~0 256)))) (= (mod c_~var_1_24~0 256) 0)) is different from false [2024-11-09 00:31:34,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:34,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950511831] [2024-11-09 00:31:34,793 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 00:31:34,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763429569] [2024-11-09 00:31:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763429569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:31:34,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:31:34,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-09 00:31:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660598833] [2024-11-09 00:31:34,794 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 00:31:34,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 00:31:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 00:31:34,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=166, Unknown=3, NotChecked=84, Total=306 [2024-11-09 00:31:34,796 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-09 00:31:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:37,909 INFO L93 Difference]: Finished difference Result 260 states and 337 transitions. [2024-11-09 00:31:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 00:31:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 160 [2024-11-09 00:31:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:37,912 INFO L225 Difference]: With dead ends: 260 [2024-11-09 00:31:37,912 INFO L226 Difference]: Without dead ends: 156 [2024-11-09 00:31:37,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=223, Invalid=598, Unknown=3, NotChecked=168, Total=992 [2024-11-09 00:31:37,913 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 233 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:37,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 342 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 00:31:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-09 00:31:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2024-11-09 00:31:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:31:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2024-11-09 00:31:37,933 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 160 [2024-11-09 00:31:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:37,934 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2024-11-09 00:31:37,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-09 00:31:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2024-11-09 00:31:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 00:31:37,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:37,936 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:31:37,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 00:31:38,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:38,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash 288909640, now seen corresponding path program 1 times [2024-11-09 00:31:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159931045] [2024-11-09 00:31:38,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:31:38,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079090433] [2024-11-09 00:31:38,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:38,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:38,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:38,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:31:38,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 00:31:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:31:38,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:31:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:31:38,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:31:38,819 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:31:38,820 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:31:38,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 00:31:39,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:39,025 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 00:31:39,156 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:31:39,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:31:39 BoogieIcfgContainer [2024-11-09 00:31:39,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:31:39,161 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:31:39,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:31:39,161 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:31:39,162 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:10" (3/4) ... [2024-11-09 00:31:39,165 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:31:39,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:31:39,166 INFO L158 Benchmark]: Toolchain (without parser) took 29852.55ms. Allocated memory was 155.2MB in the beginning and 237.0MB in the end (delta: 81.8MB). Free memory was 118.0MB in the beginning and 114.8MB in the end (delta: 3.2MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2024-11-09 00:31:39,167 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 118.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:31:39,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.12ms. Allocated memory is still 155.2MB. Free memory was 118.0MB in the beginning and 99.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 00:31:39,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.90ms. Allocated memory is still 155.2MB. Free memory was 99.9MB in the beginning and 95.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:31:39,168 INFO L158 Benchmark]: Boogie Preprocessor took 92.62ms. Allocated memory is still 155.2MB. Free memory was 95.6MB in the beginning and 88.0MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 00:31:39,168 INFO L158 Benchmark]: RCFGBuilder took 659.93ms. Allocated memory is still 155.2MB. Free memory was 87.3MB in the beginning and 103.2MB in the end (delta: -15.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:31:39,168 INFO L158 Benchmark]: TraceAbstraction took 28636.26ms. Allocated memory was 155.2MB in the beginning and 237.0MB in the end (delta: 81.8MB). Free memory was 102.3MB in the beginning and 114.8MB in the end (delta: -12.6MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-11-09 00:31:39,168 INFO L158 Benchmark]: Witness Printer took 5.39ms. Allocated memory is still 237.0MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:31:39,170 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.23ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 118.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.12ms. Allocated memory is still 155.2MB. Free memory was 118.0MB in the beginning and 99.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.90ms. Allocated memory is still 155.2MB. Free memory was 99.9MB in the beginning and 95.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.62ms. Allocated memory is still 155.2MB. Free memory was 95.6MB in the beginning and 88.0MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 659.93ms. Allocated memory is still 155.2MB. Free memory was 87.3MB in the beginning and 103.2MB in the end (delta: -15.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28636.26ms. Allocated memory was 155.2MB in the beginning and 237.0MB in the end (delta: 81.8MB). Free memory was 102.3MB in the beginning and 114.8MB in the end (delta: -12.6MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * Witness Printer took 5.39ms. Allocated memory is still 237.0MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 4; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_7 = 2819353023; [L25] signed short int var_1_9 = 25; [L26] signed short int var_1_10 = 25; [L27] signed short int var_1_11 = 0; [L28] float var_1_12 = 255.8; [L29] unsigned char var_1_14 = 200; [L30] unsigned char var_1_15 = 5; [L31] unsigned char var_1_16 = 4; [L32] float var_1_17 = 99999.5; [L33] float var_1_18 = 63.4; [L34] double var_1_19 = 63.5; [L35] double var_1_20 = 9.95; [L36] double var_1_21 = 5.7; [L37] double var_1_22 = 3.85; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] unsigned long int var_1_25 = 0; [L41] unsigned long int var_1_26 = 16; [L42] unsigned long int var_1_27 = 1840944138; [L43] unsigned short int var_1_28 = 0; [L44] float var_1_29 = 1.1; [L45] signed char var_1_30 = 25; [L46] unsigned char last_1_var_1_23 = 1; [L47] float last_1_var_1_29 = 1.1; VAL [isInitial=0, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=0, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L184] last_1_var_1_23 = var_1_23 [L185] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=0, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L144] var_1_2 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L145] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L146] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L146] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L147] var_1_7 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L148] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L149] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L149] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L150] var_1_10 = __VERIFIER_nondet_short() [L151] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L151] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L152] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L152] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L153] var_1_11 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L154] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L155] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L155] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L156] var_1_14 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_14 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L157] RET assume_abort_if_not(var_1_14 >= 191) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L158] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L158] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L159] var_1_15 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L160] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L161] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L161] RET assume_abort_if_not(var_1_15 <= 64) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L162] var_1_16 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L164] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L164] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L165] var_1_17 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L166] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L167] var_1_18 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L168] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L169] var_1_20 = __VERIFIER_nondet_double() [L170] 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, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L170] 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, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L171] var_1_21 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L172] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L173] var_1_24 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L174] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L175] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L175] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L176] var_1_26 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L177] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L178] CALL assume_abort_if_not(var_1_26 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L178] RET assume_abort_if_not(var_1_26 <= 536870912) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L179] var_1_27 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_27 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L180] RET assume_abort_if_not(var_1_27 >= 1073741823) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L181] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L181] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L196] RET updateVariables() [L197] CALL step() [L51] COND TRUE var_1_21 < (256.8 - var_1_20) [L52] var_1_22 = ((((var_1_18) < (var_1_17)) ? (var_1_18) : (var_1_17))) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L56] COND FALSE !(((((4.8f) < 0 ) ? -(4.8f) : (4.8f))) == var_1_18) [L59] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L61] unsigned long int stepLocal_5 = var_1_26; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_5=536870912, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L62] COND FALSE !(stepLocal_5 < var_1_11) [L69] var_1_28 = var_1_11 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L71] COND TRUE last_1_var_1_29 > 1.9 [L72] var_1_29 = var_1_20 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L76] unsigned char stepLocal_6 = var_1_14; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_6=191, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=25, var_1_7=10737418239, var_1_9=25] [L77] COND TRUE var_1_28 >= stepLocal_6 [L78] var_1_30 = ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=25] [L84] COND FALSE !((var_1_28 <= (var_1_28 / var_1_7)) || var_1_23) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=25] [L87] COND FALSE !(var_1_23 || var_1_23) [L90] var_1_9 = -8 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L93] COND FALSE !(var_1_22 < var_1_17) [L96] var_1_25 = ((var_1_27 - var_1_16) + var_1_15) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L98] signed long int stepLocal_4 = (((var_1_16 - var_1_14) < 0 ) ? -(var_1_16 - var_1_14) : (var_1_16 - var_1_14)); [L99] signed long int stepLocal_3 = 64; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_3=64, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L100] COND TRUE var_1_16 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L101] COND TRUE var_1_22 != var_1_17 [L102] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L111] COND FALSE !(var_1_23 || (var_1_19 < var_1_19)) [L118] var_1_12 = var_1_17 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L120] unsigned short int stepLocal_2 = var_1_28; [L121] unsigned char stepLocal_1 = var_1_23; [L122] unsigned long int stepLocal_0 = var_1_7 - var_1_28; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_0=10737385473, stepLocal_1=0, stepLocal_2=32766, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L123] COND FALSE !(stepLocal_1 && var_1_23) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_0=10737385473, stepLocal_2=32766, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L128] COND FALSE !(stepLocal_0 <= ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) [L139] var_1_1 = var_1_28 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_2=32766, stepLocal_4=64, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return ((((((((((var_1_23 && var_1_23) ? ((var_1_12 == var_1_22) ? (var_1_1 == ((unsigned long int) (var_1_28 + 10u))) : 1) : (((var_1_7 - var_1_28) <= ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) ? ((var_1_22 != var_1_12) ? ((var_1_7 < var_1_28) ? (var_1_1 == ((unsigned long int) var_1_28)) : (var_1_1 == ((unsigned long int) var_1_28))) : (var_1_1 == ((unsigned long int) var_1_28))) : (var_1_1 == ((unsigned long int) var_1_28)))) && (((var_1_28 <= (var_1_28 / var_1_7)) || var_1_23) ? (var_1_9 == ((signed short int) (var_1_10 - var_1_11))) : ((var_1_23 || var_1_23) ? (var_1_9 == ((signed short int) var_1_11)) : (var_1_9 == ((signed short int) -8))))) && ((var_1_23 || (var_1_19 < var_1_19)) ? ((((var_1_14 - var_1_15) - var_1_16) > var_1_10) ? (var_1_12 == ((float) (var_1_17 + var_1_18))) : (var_1_12 == ((float) var_1_18))) : (var_1_12 == ((float) var_1_17)))) && ((var_1_16 >= 64) ? ((var_1_22 != var_1_17) ? (var_1_19 == ((double) var_1_17)) : 1) : ((var_1_25 > ((((var_1_16 - var_1_14) < 0 ) ? -(var_1_16 - var_1_14) : (var_1_16 - var_1_14)))) ? (var_1_19 == ((double) (((((((((499.698) > (var_1_20)) ? (499.698) : (var_1_20))) - var_1_21)) < (var_1_17)) ? ((((((499.698) > (var_1_20)) ? (499.698) : (var_1_20))) - var_1_21)) : (var_1_17))))) : (var_1_19 == ((double) 9.2))))) && ((var_1_21 < (256.8 - var_1_20)) ? (var_1_22 == ((double) ((((var_1_18) < (var_1_17)) ? (var_1_18) : (var_1_17))))) : (var_1_22 == ((double) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))))))) && ((((((4.8f) < 0 ) ? -(4.8f) : (4.8f))) == var_1_18) ? (var_1_23 == ((unsigned char) (last_1_var_1_23 && (var_1_2 && var_1_24)))) : (var_1_23 == ((unsigned char) var_1_24)))) && ((var_1_22 < var_1_17) ? (var_1_25 == ((unsigned long int) (var_1_16 + ((var_1_14 + var_1_28) + var_1_11)))) : (var_1_25 == ((unsigned long int) ((var_1_27 - var_1_16) + var_1_15))))) && ((var_1_26 < var_1_11) ? (var_1_24 ? (var_1_28 == ((unsigned short int) ((((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) > (var_1_14)) ? (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) : (var_1_14))))) : (var_1_28 == ((unsigned short int) ((((var_1_14) < (var_1_11)) ? (var_1_14) : (var_1_11)))))) : (var_1_28 == ((unsigned short int) var_1_11)))) && ((last_1_var_1_29 > 1.9) ? (var_1_29 == ((float) var_1_20)) : (var_1_29 == ((float) ((((var_1_21 - var_1_20) < 0 ) ? -(var_1_21 - var_1_20) : (var_1_21 - var_1_20))))))) && ((var_1_28 >= var_1_14) ? (var_1_30 == ((signed char) ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))))) : ((! var_1_23) ? (var_1_30 == ((signed char) ((((-1) < 0 ) ? -(-1) : (-1))))) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=191, var_1_15=512, var_1_16=127, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=2147483520, var_1_26=536870912, var_1_27=2147483647, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=0, var_1_7=10737418239, var_1_9=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1108 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1063 mSDsluCounter, 1636 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1057 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1742 IncrementalHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 579 mSDtfsCounter, 1742 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1037 GetRequests, 920 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=3, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 346 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 1596 NumberOfCodeBlocks, 1596 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 4605 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1123 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 7431/7728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:31:39,386 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-09 00:31:39,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f78f07977a6a6c060ce47508f319b35375a64382f2792ef417cdb466597e7230 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:31:41,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:31:41,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:31:41,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:31:41,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:31:41,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:31:41,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:31:41,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:31:41,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:31:41,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:31:41,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:31:41,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:31:41,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:31:41,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:31:41,638 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:31:41,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:31:41,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:31:41,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:31:41,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:31:41,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:31:41,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:31:41,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:31:41,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:31:41,644 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:31:41,645 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:31:41,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:31:41,645 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:31:41,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:31:41,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:31:41,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:31:41,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:31:41,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:31:41,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:31:41,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:31:41,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:31:41,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:31:41,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:31:41,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:31:41,652 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:31:41,652 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:31:41,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:31:41,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:31:41,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:31:41,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:31:41,653 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f78f07977a6a6c060ce47508f319b35375a64382f2792ef417cdb466597e7230 [2024-11-09 00:31:42,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:31:42,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:31:42,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:31:42,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:31:42,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:31:42,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i [2024-11-09 00:31:43,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:31:44,025 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:31:44,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i [2024-11-09 00:31:44,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77ef6895/923da38e222c4dc4b662de1ba1aa0e13/FLAG3cea4c34d [2024-11-09 00:31:44,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77ef6895/923da38e222c4dc4b662de1ba1aa0e13 [2024-11-09 00:31:44,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:31:44,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:31:44,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:44,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:31:44,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:31:44,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4866a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44, skipping insertion in model container [2024-11-09 00:31:44,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:31:44,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i[916,929] [2024-11-09 00:31:44,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:44,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:31:44,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i[916,929] [2024-11-09 00:31:44,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:44,509 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:31:44,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44 WrapperNode [2024-11-09 00:31:44,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:44,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:44,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:31:44,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:31:44,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,583 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-09 00:31:44,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:44,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:31:44,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:31:44,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:31:44,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,644 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:31:44,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:31:44,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:31:44,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:31:44,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:31:44,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (1/1) ... [2024-11-09 00:31:44,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:31:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:44,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:31:44,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:31:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:31:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:31:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:31:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:31:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:31:44,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:31:44,911 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:31:44,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:31:53,454 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 00:31:53,455 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:31:53,471 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:31:53,472 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:31:53,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:53 BoogieIcfgContainer [2024-11-09 00:31:53,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:31:53,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:31:53,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:31:53,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:31:53,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:31:44" (1/3) ... [2024-11-09 00:31:53,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3428f053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:31:53, skipping insertion in model container [2024-11-09 00:31:53,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:44" (2/3) ... [2024-11-09 00:31:53,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3428f053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:31:53, skipping insertion in model container [2024-11-09 00:31:53,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:53" (3/3) ... [2024-11-09 00:31:53,480 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-97.i [2024-11-09 00:31:53,497 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:31:53,497 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:31:53,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:31:53,577 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;@781804c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:31:53,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:31:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:31:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:31:53,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:53,597 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:31:53,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash -526305821, now seen corresponding path program 1 times [2024-11-09 00:31:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:31:53,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711651584] [2024-11-09 00:31:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:53,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:31:53,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:31:53,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:31:53,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:31:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:54,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:31:54,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-09 00:31:54,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:31:54,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:31:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711651584] [2024-11-09 00:31:54,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711651584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:31:54,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:31:54,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:31:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392485033] [2024-11-09 00:31:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:31:54,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:31:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:31:54,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:31:54,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:31:54,337 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:31:54,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:54,376 INFO L93 Difference]: Finished difference Result 155 states and 272 transitions. [2024-11-09 00:31:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:31:54,380 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-09 00:31:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:54,388 INFO L225 Difference]: With dead ends: 155 [2024-11-09 00:31:54,389 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 00:31:54,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:31:54,406 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:54,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:31:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 00:31:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 00:31:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:31:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-11-09 00:31:54,464 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 159 [2024-11-09 00:31:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:54,464 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-11-09 00:31:54,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:31:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-11-09 00:31:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:31:54,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:54,471 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:31:54,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:31:54,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:31:54,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:54,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:54,674 INFO L85 PathProgramCache]: Analyzing trace with hash -179999509, now seen corresponding path program 1 times [2024-11-09 00:31:54,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:31:54,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205987227] [2024-11-09 00:31:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:54,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:31:54,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:31:54,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:31:54,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:31:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:55,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 00:31:55,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:31:59,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:31:59,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:31:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205987227] [2024-11-09 00:31:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205987227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:31:59,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:31:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:31:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536268161] [2024-11-09 00:31:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:31:59,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:31:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:31:59,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:31:59,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:31:59,988 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:32:01,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:32:07,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:32:11,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:32:15,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:32:20,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:32:24,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:32:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:24,727 INFO L93 Difference]: Finished difference Result 226 states and 355 transitions. [2024-11-09 00:32:24,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:32:24,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-09 00:32:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:24,736 INFO L225 Difference]: With dead ends: 226 [2024-11-09 00:32:24,736 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 00:32:24,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:32:24,739 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 75 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 49 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:32:24,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 287 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 65 Invalid, 4 Unknown, 0 Unchecked, 24.6s Time] [2024-11-09 00:32:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 00:32:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2024-11-09 00:32:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 00:32:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2024-11-09 00:32:24,779 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 159 [2024-11-09 00:32:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:24,779 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2024-11-09 00:32:24,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:32:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2024-11-09 00:32:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:32:24,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:24,788 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:32:24,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:32:24,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:32:24,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:24,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1201067863, now seen corresponding path program 1 times [2024-11-09 00:32:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:24,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471513510] [2024-11-09 00:32:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:24,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:32:24,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:24,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:32:24,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 00:32:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:25,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:32:25,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-09 00:32:26,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:32:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-09 00:32:28,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:32:28,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471513510] [2024-11-09 00:32:28,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471513510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:32:28,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:32:28,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-09 00:32:28,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007888662] [2024-11-09 00:32:28,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:32:28,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:32:28,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:32:28,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:32:28,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:32:28,195 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)