./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.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 bace99ce93e5ece7a5d4929375122218229d03f0bd524bcb0f242f4f10c4f45b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:36:46,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:36:46,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:36:46,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:36:46,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:36:46,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:36:46,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:36:46,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:36:46,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:36:46,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:36:46,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:36:46,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:36:46,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:36:46,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:36:46,226 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:36:46,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:36:46,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:36:46,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:36:46,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:36:46,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:36:46,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:36:46,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:36:46,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:36:46,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:36:46,229 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:36:46,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:36:46,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:36:46,230 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:36:46,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:36:46,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:36:46,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:36:46,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:36:46,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:36:46,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:36:46,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:36:46,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:36:46,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:36:46,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:36:46,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:36:46,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:36:46,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:36:46,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:36:46,235 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 -> bace99ce93e5ece7a5d4929375122218229d03f0bd524bcb0f242f4f10c4f45b [2024-10-13 05:36:46,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:36:46,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:36:46,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:36:46,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:36:46,534 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:36:46,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.i [2024-10-13 05:36:48,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:36:48,258 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:36:48,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.i [2024-10-13 05:36:48,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5acda85d/79bf7029e85e4256a92b7205fe1cad28/FLAGaad82081a [2024-10-13 05:36:48,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5acda85d/79bf7029e85e4256a92b7205fe1cad28 [2024-10-13 05:36:48,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:36:48,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:36:48,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:36:48,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:36:48,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:36:48,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c8b418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48, skipping insertion in model container [2024-10-13 05:36:48,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:36:48,519 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.i[915,928] [2024-10-13 05:36:48,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:36:48,598 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:36:48,610 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.i[915,928] [2024-10-13 05:36:48,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:36:48,660 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:36:48,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48 WrapperNode [2024-10-13 05:36:48,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:36:48,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:36:48,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:36:48,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:36:48,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,723 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-10-13 05:36:48,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:36:48,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:36:48,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:36:48,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:36:48,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,772 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:36:48,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:36:48,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:36:48,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:36:48,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:36:48,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (1/1) ... [2024-10-13 05:36:48,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:36:48,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:36:48,839 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-10-13 05:36:48,847 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-10-13 05:36:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:36:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:36:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:36:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:36:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:36:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:36:48,980 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:36:48,982 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:36:49,357 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 05:36:49,357 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:36:49,403 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:36:49,403 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:36:49,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:36:49 BoogieIcfgContainer [2024-10-13 05:36:49,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:36:49,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:36:49,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:36:49,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:36:49,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:36:48" (1/3) ... [2024-10-13 05:36:49,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428876ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:36:49, skipping insertion in model container [2024-10-13 05:36:49,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:36:48" (2/3) ... [2024-10-13 05:36:49,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428876ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:36:49, skipping insertion in model container [2024-10-13 05:36:49,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:36:49" (3/3) ... [2024-10-13 05:36:49,420 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-49.i [2024-10-13 05:36:49,437 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:36:49,438 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:36:49,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:36:49,501 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;@146a00c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:36:49,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:36:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 05:36:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 05:36:49,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:36:49,523 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:36:49,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:36:49,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:36:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1808701978, now seen corresponding path program 1 times [2024-10-13 05:36:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:36:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50513698] [2024-10-13 05:36:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:36:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:36:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:36:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:36:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:36:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:36:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:36:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:36:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:36:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:36:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:36:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 05:36:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 05:36:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:36:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:36:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:36:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:36:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:36:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:36:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:36:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:36:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 05:36:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:36:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 05:36:49,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:36:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50513698] [2024-10-13 05:36:49,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50513698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:36:49,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:36:49,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:36:49,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035538815] [2024-10-13 05:36:49,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:36:49,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:36:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:36:50,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:36:50,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:36:50,024 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 05:36:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:36:50,075 INFO L93 Difference]: Finished difference Result 128 states and 225 transitions. [2024-10-13 05:36:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:36:50,078 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2024-10-13 05:36:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:36:50,119 INFO L225 Difference]: With dead ends: 128 [2024-10-13 05:36:50,119 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 05:36:50,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:36:50,134 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:36:50,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:36:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 05:36:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 05:36:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 05:36:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-13 05:36:50,220 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 131 [2024-10-13 05:36:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:36:50,222 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-13 05:36:50,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 05:36:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-13 05:36:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 05:36:50,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:36:50,229 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:36:50,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:36:50,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:36:50,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:36:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1083606000, now seen corresponding path program 1 times [2024-10-13 05:36:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:36:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907379124] [2024-10-13 05:36:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:36:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:36:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:36:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:36:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:36:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:36:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:36:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:36:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:36:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:36:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:36:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 05:36:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 05:36:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:36:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:36:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:36:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:36:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:36:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:36:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:36:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:36:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 05:36:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:36:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 05:36:50,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:36:50,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907379124] [2024-10-13 05:36:50,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907379124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:36:50,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:36:50,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:36:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706979926] [2024-10-13 05:36:50,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:36:50,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:36:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:36:50,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:36:50,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:36:50,905 INFO L87 Difference]: Start difference. First operand 63 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 05:36:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:36:51,104 INFO L93 Difference]: Finished difference Result 187 states and 285 transitions. [2024-10-13 05:36:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:36:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2024-10-13 05:36:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:36:51,108 INFO L225 Difference]: With dead ends: 187 [2024-10-13 05:36:51,109 INFO L226 Difference]: Without dead ends: 125 [2024-10-13 05:36:51,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:36:51,111 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:36:51,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 266 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:36:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-13 05:36:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2024-10-13 05:36:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 05:36:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 160 transitions. [2024-10-13 05:36:51,139 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 160 transitions. Word has length 131 [2024-10-13 05:36:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:36:51,140 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 160 transitions. [2024-10-13 05:36:51,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 05:36:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 160 transitions. [2024-10-13 05:36:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 05:36:51,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:36:51,143 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:36:51,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:36:51,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:36:51,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:36:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1047054373, now seen corresponding path program 1 times [2024-10-13 05:36:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:36:51,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035144286] [2024-10-13 05:36:51,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:36:51,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:36:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:36:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:36:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:36:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:36:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:36:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:36:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:36:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:36:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:36:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 05:36:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 05:36:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:36:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:36:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:36:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:36:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:36:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:36:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:36:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:36:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 05:36:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:36:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 05:36:51,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:36:51,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035144286] [2024-10-13 05:36:51,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035144286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:36:51,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:36:51,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:36:51,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660360217] [2024-10-13 05:36:51,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:36:51,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:36:51,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:36:51,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:36:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:36:51,493 INFO L87 Difference]: Start difference. First operand 105 states and 160 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 05:36:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:36:51,534 INFO L93 Difference]: Finished difference Result 168 states and 257 transitions. [2024-10-13 05:36:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:36:51,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-10-13 05:36:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:36:51,540 INFO L225 Difference]: With dead ends: 168 [2024-10-13 05:36:51,541 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 05:36:51,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:36:51,543 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:36:51,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:36:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 05:36:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 05:36:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 61 states have internal predecessors, (77), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 05:36:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 161 transitions. [2024-10-13 05:36:51,575 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 161 transitions. Word has length 132 [2024-10-13 05:36:51,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:36:51,576 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 161 transitions. [2024-10-13 05:36:51,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 05:36:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 161 transitions. [2024-10-13 05:36:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 05:36:51,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:36:51,578 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:36:51,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:36:51,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:36:51,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:36:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1661685543, now seen corresponding path program 1 times [2024-10-13 05:36:51,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:36:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312241333] [2024-10-13 05:36:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:36:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:36:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:36:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:36:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:36:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:36:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:36:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:36:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:36:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:36:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:36:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 05:36:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 05:36:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:36:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:36:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:36:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:36:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:36:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:36:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:36:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:36:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 05:36:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:36:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 05:36:52,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:36:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312241333] [2024-10-13 05:36:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312241333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:36:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361739298] [2024-10-13 05:36:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:36:52,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:36:52,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:36:52,177 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-10-13 05:36:52,183 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-10-13 05:36:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:36:52,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 05:36:52,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:36:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-13 05:36:53,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:36:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 05:36:54,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361739298] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:36:54,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:36:54,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2024-10-13 05:36:54,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892739634] [2024-10-13 05:36:54,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:36:54,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 05:36:54,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:36:54,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 05:36:54,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-13 05:36:54,079 INFO L87 Difference]: Start difference. First operand 106 states and 161 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-10-13 05:36:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:36:55,446 INFO L93 Difference]: Finished difference Result 483 states and 704 transitions. [2024-10-13 05:36:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-13 05:36:55,447 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 133 [2024-10-13 05:36:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:36:55,451 INFO L225 Difference]: With dead ends: 483 [2024-10-13 05:36:55,452 INFO L226 Difference]: Without dead ends: 419 [2024-10-13 05:36:55,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=450, Invalid=1190, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 05:36:55,455 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 491 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 05:36:55,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 487 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 05:36:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-13 05:36:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2024-10-13 05:36:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 204 states have internal predecessors, (252), 107 states have call successors, (107), 10 states have call predecessors, (107), 10 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-13 05:36:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 466 transitions. [2024-10-13 05:36:55,553 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 466 transitions. Word has length 133 [2024-10-13 05:36:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:36:55,554 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 466 transitions. [2024-10-13 05:36:55,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-10-13 05:36:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 466 transitions. [2024-10-13 05:36:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:36:55,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:36:55,560 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:36:55,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 05:36:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:36:55,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:36:55,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:36:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1005259608, now seen corresponding path program 1 times [2024-10-13 05:36:55,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:36:55,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958322115] [2024-10-13 05:36:55,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:36:55,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:36:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:36:55,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802184893] [2024-10-13 05:36:55,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:36:55,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:36:55,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:36:55,851 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-10-13 05:36:55,853 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-10-13 05:36:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:36:56,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:36:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:36:56,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:36:56,276 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:36:56,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:36:56,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 05:36:56,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:36:56,488 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 05:36:56,583 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:36:56,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:36:56 BoogieIcfgContainer [2024-10-13 05:36:56,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:36:56,590 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:36:56,590 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:36:56,590 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:36:56,591 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:36:49" (3/4) ... [2024-10-13 05:36:56,593 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:36:56,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:36:56,595 INFO L158 Benchmark]: Toolchain (without parser) took 8301.16ms. Allocated memory was 161.5MB in the beginning and 247.5MB in the end (delta: 86.0MB). Free memory was 87.6MB in the beginning and 121.9MB in the end (delta: -34.3MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2024-10-13 05:36:56,595 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 161.5MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:36:56,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.90ms. Allocated memory is still 161.5MB. Free memory was 87.3MB in the beginning and 71.7MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:36:56,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.12ms. Allocated memory is still 161.5MB. Free memory was 71.7MB in the beginning and 67.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:36:56,596 INFO L158 Benchmark]: Boogie Preprocessor took 77.42ms. Allocated memory is still 161.5MB. Free memory was 67.8MB in the beginning and 62.1MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 05:36:56,596 INFO L158 Benchmark]: RCFGBuilder took 601.03ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 62.1MB in the beginning and 156.1MB in the end (delta: -94.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-10-13 05:36:56,596 INFO L158 Benchmark]: TraceAbstraction took 7179.77ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 155.1MB in the beginning and 121.9MB in the end (delta: 33.2MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2024-10-13 05:36:56,596 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 247.5MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:36:56,598 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.12ms. Allocated memory is still 161.5MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.90ms. Allocated memory is still 161.5MB. Free memory was 87.3MB in the beginning and 71.7MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.12ms. Allocated memory is still 161.5MB. Free memory was 71.7MB in the beginning and 67.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.42ms. Allocated memory is still 161.5MB. Free memory was 67.8MB in the beginning and 62.1MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 601.03ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 62.1MB in the beginning and 156.1MB in the end (delta: -94.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7179.77ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 155.1MB in the beginning and 121.9MB in the end (delta: 33.2MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 247.5MB. Free memory is still 121.9MB. 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 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of bitwiseAnd at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 10; [L23] unsigned long int var_1_3 = 3171453299; [L24] unsigned long int var_1_4 = 2038274679; [L25] unsigned long int var_1_5 = 1375699353; [L26] unsigned short int var_1_8 = 16; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 1; [L29] double var_1_14 = 64.45; [L30] float var_1_15 = 31.15; [L31] float var_1_16 = 16.4; [L32] double var_1_17 = 100.625; [L33] double var_1_18 = 128.1; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 8; [L36] unsigned char var_1_21 = 100; [L37] unsigned char var_1_22 = 0; [L38] signed char var_1_23 = 2; [L39] unsigned char var_1_24 = 0; [L40] unsigned long int last_1_var_1_1 = 10; [L41] unsigned short int last_1_var_1_8 = 16; [L42] unsigned char last_1_var_1_12 = 1; [L43] unsigned char last_1_var_1_19 = 1; [L44] unsigned char last_1_var_1_22 = 0; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L123] last_1_var_1_1 = var_1_1 [L124] last_1_var_1_8 = var_1_8 [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_19 = var_1_19 [L127] last_1_var_1_22 = var_1_22 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L89] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L91] var_1_4 = __VERIFIER_nondet_ulong() [L92] CALL assume_abort_if_not(var_1_4 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L92] RET assume_abort_if_not(var_1_4 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L93] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L93] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L94] var_1_5 = __VERIFIER_nondet_ulong() [L95] CALL assume_abort_if_not(var_1_5 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L95] RET assume_abort_if_not(var_1_5 >= 1073741824) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L98] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L99] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L99] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L100] var_1_15 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L102] var_1_16 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L103] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L104] var_1_17 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L105] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L106] var_1_18 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L107] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L110] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L110] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L113] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L113] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L114] var_1_23 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_23 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L115] RET assume_abort_if_not(var_1_23 >= -128) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L116] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L116] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L117] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L117] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L118] var_1_24 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L119] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L120] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L120] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L138] RET updateVariables() [L139] CALL step() [L48] COND TRUE ! last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L49] COND TRUE (last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19 [L50] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L55] COND TRUE \read(last_1_var_1_12) [L56] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L58] COND FALSE !(var_1_13 && last_1_var_1_22) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L65] var_1_8 = ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19))))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L66] COND TRUE (((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16 [L67] var_1_14 = ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L69] EXPR var_1_19 & var_1_4 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L69] COND FALSE !((-2 / var_1_23) >= (var_1_19 & var_1_4)) [L84] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=-256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=-256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L130-L131] return (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=-256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=-256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 581 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 1024 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 675 mSDsCounter, 372 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 684 IncrementalHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 372 mSolverCounterUnsat, 349 mSDtfsCounter, 684 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=4, InterpolantAutomatonStates: 43, 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, 4 MinimizatonAttempts, 118 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 928 NumberOfCodeBlocks, 928 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 3196 SizeOfPredicates, 3 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4878/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 05:36:56,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.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 bace99ce93e5ece7a5d4929375122218229d03f0bd524bcb0f242f4f10c4f45b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:36:58,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:36:58,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:36:58,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:36:58,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:36:59,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:36:59,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:36:59,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:36:59,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:36:59,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:36:59,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:36:59,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:36:59,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:36:59,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:36:59,022 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:36:59,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:36:59,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:36:59,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:36:59,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:36:59,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:36:59,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:36:59,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:36:59,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:36:59,027 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:36:59,027 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:36:59,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:36:59,028 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:36:59,028 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:36:59,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:36:59,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:36:59,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:36:59,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:36:59,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:36:59,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:36:59,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:36:59,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:36:59,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:36:59,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:36:59,043 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:36:59,044 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:36:59,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:36:59,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:36:59,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:36:59,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:36:59,045 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:36:59,045 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 -> bace99ce93e5ece7a5d4929375122218229d03f0bd524bcb0f242f4f10c4f45b [2024-10-13 05:36:59,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:36:59,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:36:59,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:36:59,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:36:59,395 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:36:59,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.i [2024-10-13 05:37:00,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:37:01,139 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:37:01,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.i [2024-10-13 05:37:01,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ccbc8b4/473680fb6e5b4d6cb22e91c0232e4ec1/FLAGa549edadb [2024-10-13 05:37:01,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ccbc8b4/473680fb6e5b4d6cb22e91c0232e4ec1 [2024-10-13 05:37:01,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:37:01,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:37:01,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:37:01,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:37:01,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:37:01,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:01,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d5e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01, skipping insertion in model container [2024-10-13 05:37:01,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:01,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:37:01,749 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.i[915,928] [2024-10-13 05:37:01,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:37:01,849 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:37:01,862 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-49.i[915,928] [2024-10-13 05:37:01,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:37:01,929 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:37:01,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01 WrapperNode [2024-10-13 05:37:01,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:37:01,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:37:01,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:37:01,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:37:01,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:01,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:01,993 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-13 05:37:01,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:37:01,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:37:01,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:37:01,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:37:02,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:02,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:02,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:02,044 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:37:02,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:02,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:02,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:02,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:02,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:02,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:02,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:37:02,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:37:02,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:37:02,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:37:02,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (1/1) ... [2024-10-13 05:37:02,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:37:02,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:37:02,123 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-10-13 05:37:02,126 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-10-13 05:37:02,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:37:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:37:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:37:02,176 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:37:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:37:02,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:37:02,279 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:37:02,281 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:37:02,767 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 05:37:02,768 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:37:02,826 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:37:02,827 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:37:02,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:37:02 BoogieIcfgContainer [2024-10-13 05:37:02,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:37:02,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:37:02,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:37:02,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:37:02,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:37:01" (1/3) ... [2024-10-13 05:37:02,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcc8909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:37:02, skipping insertion in model container [2024-10-13 05:37:02,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:37:01" (2/3) ... [2024-10-13 05:37:02,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcc8909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:37:02, skipping insertion in model container [2024-10-13 05:37:02,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:37:02" (3/3) ... [2024-10-13 05:37:02,838 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-49.i [2024-10-13 05:37:02,857 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:37:02,857 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:37:02,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:37:02,946 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;@37f01cae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:37:02,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:37:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 05:37:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 05:37:02,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:37:02,968 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:37:02,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:37:02,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:37:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash -293554635, now seen corresponding path program 1 times [2024-10-13 05:37:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:37:02,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789688134] [2024-10-13 05:37:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:37:02,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-10-13 05:37:02,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:37:02,995 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-10-13 05:37:02,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 (2)] Waiting until timeout for monitored process [2024-10-13 05:37:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:37:03,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:37:03,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:37:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-13 05:37:03,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:37:03,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:37:03,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789688134] [2024-10-13 05:37:03,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789688134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:37:03,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:37:03,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:37:03,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362044361] [2024-10-13 05:37:03,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:37:03,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:37:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:37:03,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:37:03,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:37:03,382 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 05:37:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:37:03,493 INFO L93 Difference]: Finished difference Result 110 states and 197 transitions. [2024-10-13 05:37:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:37:03,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2024-10-13 05:37:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:37:03,515 INFO L225 Difference]: With dead ends: 110 [2024-10-13 05:37:03,516 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 05:37:03,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:37:03,524 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:37:03,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:37:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 05:37:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 05:37:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 05:37:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2024-10-13 05:37:03,585 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 128 [2024-10-13 05:37:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:37:03,586 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2024-10-13 05:37:03,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 05:37:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2024-10-13 05:37:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 05:37:03,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:37:03,594 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:37:03,603 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-10-13 05:37:03,794 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-10-13 05:37:03,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:37:03,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:37:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1110612885, now seen corresponding path program 1 times [2024-10-13 05:37:03,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:37:03,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631855284] [2024-10-13 05:37:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:37:03,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:37:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:37:03,799 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-10-13 05:37:03,800 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-10-13 05:37:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:37:04,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 05:37:04,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:37:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 05:37:04,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:37:04,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:37:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631855284] [2024-10-13 05:37:04,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631855284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:37:04,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:37:04,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:37:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623677336] [2024-10-13 05:37:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:37:04,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:37:04,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:37:04,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:37:04,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:37:04,510 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 05:37:04,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:37:04,962 INFO L93 Difference]: Finished difference Result 167 states and 255 transitions. [2024-10-13 05:37:04,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:37:04,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2024-10-13 05:37:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:37:04,978 INFO L225 Difference]: With dead ends: 167 [2024-10-13 05:37:04,980 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 05:37:04,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:37:04,984 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:37:04,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 233 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:37:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 05:37:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2024-10-13 05:37:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 05:37:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 144 transitions. [2024-10-13 05:37:05,016 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 144 transitions. Word has length 128 [2024-10-13 05:37:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:37:05,017 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 144 transitions. [2024-10-13 05:37:05,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 05:37:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 144 transitions. [2024-10-13 05:37:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 05:37:05,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:37:05,019 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:37:05,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 05:37:05,223 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-10-13 05:37:05,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:37:05,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:37:05,225 INFO L85 PathProgramCache]: Analyzing trace with hash 73365270, now seen corresponding path program 1 times [2024-10-13 05:37:05,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:37:05,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559476022] [2024-10-13 05:37:05,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:37:05,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:37:05,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:37:05,229 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-10-13 05:37:05,230 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-10-13 05:37:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:37:05,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 05:37:05,462 INFO L278 TraceCheckSpWp]: Computing forward predicates...