./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-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-21.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdfa3058933baefd56be26cb7e27738d81c85b0fac7f1e9c4f346090174ee4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:52:21,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:52:21,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:52:21,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:52:21,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:52:21,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:52:21,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:52:21,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:52:21,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:52:21,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:52:21,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:52:21,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:52:21,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:52:21,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:52:21,799 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:52:21,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:52:21,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:52:21,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:52:21,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:52:21,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:52:21,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:52:21,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:52:21,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:52:21,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:52:21,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:52:21,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:52:21,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:52:21,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:52:21,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:52:21,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:52:21,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:52:21,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:52:21,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:52:21,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:52:21,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:52:21,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:52:21,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:52:21,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:52:21,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:52:21,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:52:21,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:52:21,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:52:21,807 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fdfa3058933baefd56be26cb7e27738d81c85b0fac7f1e9c4f346090174ee4b [2024-10-11 12:52:22,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:52:22,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:52:22,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:52:22,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:52:22,076 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:52:22,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-21.i [2024-10-11 12:52:23,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:52:23,500 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:52:23,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-21.i [2024-10-11 12:52:23,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/97cc35c89/6af0aa51ee6f4ac086b054f8f1ed1137/FLAG8c34246c2 [2024-10-11 12:52:23,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/97cc35c89/6af0aa51ee6f4ac086b054f8f1ed1137 [2024-10-11 12:52:23,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:52:23,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:52:23,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:52:23,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:52:23,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:52:23,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:23,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66308aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23, skipping insertion in model container [2024-10-11 12:52:23,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:23,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:52:23,722 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-21.i[915,928] [2024-10-11 12:52:23,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:52:23,804 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:52:23,813 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-21.i[915,928] [2024-10-11 12:52:23,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:52:23,862 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:52:23,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23 WrapperNode [2024-10-11 12:52:23,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:52:23,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:52:23,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:52:23,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:52:23,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:23,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:23,921 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-10-11 12:52:23,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:52:23,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:52:23,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:52:23,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:52:23,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:23,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:23,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:23,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:52:23,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:23,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:23,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:23,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:24,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:24,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:24,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:52:24,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:52:24,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:52:24,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:52:24,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (1/1) ... [2024-10-11 12:52:24,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:52:24,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:52:24,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:52:24,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:52:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:52:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:52:24,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:52:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:52:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:52:24,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:52:24,159 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:52:24,160 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:52:24,510 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 12:52:24,510 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:52:24,544 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:52:24,545 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:52:24,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:52:24 BoogieIcfgContainer [2024-10-11 12:52:24,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:52:24,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:52:24,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:52:24,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:52:24,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:52:23" (1/3) ... [2024-10-11 12:52:24,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375f8711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:52:24, skipping insertion in model container [2024-10-11 12:52:24,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:23" (2/3) ... [2024-10-11 12:52:24,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375f8711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:52:24, skipping insertion in model container [2024-10-11 12:52:24,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:52:24" (3/3) ... [2024-10-11 12:52:24,552 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-21.i [2024-10-11 12:52:24,565 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:52:24,566 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:52:24,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:52:24,628 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;@460e7bad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:52:24,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:52:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 12:52:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 12:52:24,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:52:24,646 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:52:24,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:52:24,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:52:24,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1129608322, now seen corresponding path program 1 times [2024-10-11 12:52:24,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:52:24,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902335500] [2024-10-11 12:52:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:52:24,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:52:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:52:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:52:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:52:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:52:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:52:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:52:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:52:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:52:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:52:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:52:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:52:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:52:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:52:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:52:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:52:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:52:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:52:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:52:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:52:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:52:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:52:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 12:52:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 12:52:24,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:52:24,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902335500] [2024-10-11 12:52:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902335500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:52:24,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:52:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:52:24,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871342240] [2024-10-11 12:52:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:52:24,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:52:24,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:52:25,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:52:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:52:25,019 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 12:52:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:52:25,059 INFO L93 Difference]: Finished difference Result 133 states and 226 transitions. [2024-10-11 12:52:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:52:25,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2024-10-11 12:52:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:52:25,070 INFO L225 Difference]: With dead ends: 133 [2024-10-11 12:52:25,070 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 12:52:25,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:52:25,076 INFO L432 NwaCegarLoop]: 95 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, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:52:25,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:52:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 12:52:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 12:52:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 12:52:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-10-11 12:52:25,123 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 140 [2024-10-11 12:52:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:52:25,124 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-10-11 12:52:25,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 12:52:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-10-11 12:52:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 12:52:25,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:52:25,126 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:52:25,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:52:25,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:52:25,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:52:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1321165254, now seen corresponding path program 1 times [2024-10-11 12:52:25,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:52:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433631809] [2024-10-11 12:52:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:52:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:52:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:52:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:52:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:52:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:52:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:52:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:52:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:52:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:52:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:52:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:52:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:52:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:52:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:52:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:52:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:52:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:52:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:52:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:52:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:52:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:52:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:52:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 12:52:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 12:52:26,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:52:26,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433631809] [2024-10-11 12:52:26,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433631809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:52:26,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:52:26,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:52:26,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59127922] [2024-10-11 12:52:26,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:52:26,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:52:26,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:52:26,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:52:26,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:52:26,309 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 12:52:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:52:26,630 INFO L93 Difference]: Finished difference Result 193 states and 278 transitions. [2024-10-11 12:52:26,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:52:26,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-10-11 12:52:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:52:26,636 INFO L225 Difference]: With dead ends: 193 [2024-10-11 12:52:26,636 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 12:52:26,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:52:26,637 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 74 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:52:26,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 418 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:52:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 12:52:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 114. [2024-10-11 12:52:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.3125) internal successors, (105), 81 states have internal predecessors, (105), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:52:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-10-11 12:52:26,665 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 140 [2024-10-11 12:52:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:52:26,667 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-10-11 12:52:26,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 12:52:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-10-11 12:52:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 12:52:26,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:52:26,671 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:52:26,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:52:26,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:52:26,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:52:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash 928138244, now seen corresponding path program 1 times [2024-10-11 12:52:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:52:26,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228118877] [2024-10-11 12:52:26,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:52:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:52:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:52:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:52:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:52:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:52:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:52:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:52:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:52:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:52:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:52:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:52:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:52:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:52:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:52:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:52:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:52:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:52:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:52:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:52:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:52:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:52:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:52:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 12:52:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 12:52:26,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:52:26,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228118877] [2024-10-11 12:52:26,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228118877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:52:26,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:52:26,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:52:26,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529076114] [2024-10-11 12:52:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:52:26,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:52:26,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:52:26,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:52:26,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:52:26,778 INFO L87 Difference]: Start difference. First operand 114 states and 165 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 12:52:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:52:26,803 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-10-11 12:52:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:52:26,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-10-11 12:52:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:52:26,808 INFO L225 Difference]: With dead ends: 218 [2024-10-11 12:52:26,808 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 12:52:26,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:52:26,811 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:52:26,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:52:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 12:52:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 12:52:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:52:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 149 transitions. [2024-10-11 12:52:26,825 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 149 transitions. Word has length 140 [2024-10-11 12:52:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:52:26,825 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 149 transitions. [2024-10-11 12:52:26,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 12:52:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 149 transitions. [2024-10-11 12:52:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 12:52:26,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:52:26,827 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:52:26,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:52:26,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:52:26,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:52:26,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1579330692, now seen corresponding path program 1 times [2024-10-11 12:52:26,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:52:26,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84716190] [2024-10-11 12:52:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:52:26,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:52:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:52:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:52:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:52:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:52:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:52:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:52:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:52:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:52:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:52:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:52:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:52:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:52:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:52:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:52:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:52:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:52:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:52:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:52:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:52:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:52:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:52:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 12:52:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 12:52:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:52:26,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84716190] [2024-10-11 12:52:26,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84716190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:52:26,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:52:26,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:52:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491422512] [2024-10-11 12:52:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:52:26,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:52:26,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:52:26,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:52:26,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:52:26,934 INFO L87 Difference]: Start difference. First operand 105 states and 149 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 12:52:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:52:26,964 INFO L93 Difference]: Finished difference Result 190 states and 270 transitions. [2024-10-11 12:52:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:52:26,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-10-11 12:52:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:52:26,966 INFO L225 Difference]: With dead ends: 190 [2024-10-11 12:52:26,966 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 12:52:26,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:52:26,968 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:52:26,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:52:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 12:52:26,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 12:52:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 53 states have internal predecessors, (61), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:52:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2024-10-11 12:52:26,979 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 140 [2024-10-11 12:52:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:52:26,979 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2024-10-11 12:52:26,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 12:52:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2024-10-11 12:52:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 12:52:26,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:52:26,981 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:52:26,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:52:26,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:52:26,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:52:26,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2059989781, now seen corresponding path program 1 times [2024-10-11 12:52:26,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:52:26,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091328181] [2024-10-11 12:52:26,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:52:26,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:52:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:52:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203011884] [2024-10-11 12:52:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:52:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:52:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:52:27,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:52:27,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:52:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:52:27,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:52:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:52:27,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:52:27,377 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:52:27,378 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:52:27,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 12:52:27,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:52:27,589 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 12:52:27,670 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:52:27,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:52:27 BoogieIcfgContainer [2024-10-11 12:52:27,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:52:27,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:52:27,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:52:27,673 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:52:27,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:52:24" (3/4) ... [2024-10-11 12:52:27,674 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:52:27,675 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:52:27,676 INFO L158 Benchmark]: Toolchain (without parser) took 4144.80ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 113.9MB in the beginning and 115.4MB in the end (delta: -1.5MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2024-10-11 12:52:27,676 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 100.7MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:52:27,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.86ms. Allocated memory is still 165.7MB. Free memory was 113.9MB in the beginning and 97.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:52:27,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.94ms. Allocated memory is still 165.7MB. Free memory was 97.2MB in the beginning and 93.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:52:27,677 INFO L158 Benchmark]: Boogie Preprocessor took 84.25ms. Allocated memory is still 165.7MB. Free memory was 93.1MB in the beginning and 128.3MB in the end (delta: -35.3MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-10-11 12:52:27,677 INFO L158 Benchmark]: RCFGBuilder took 537.81ms. Allocated memory is still 165.7MB. Free memory was 128.3MB in the beginning and 111.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:52:27,677 INFO L158 Benchmark]: TraceAbstraction took 3125.41ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 111.3MB in the beginning and 115.4MB in the end (delta: -4.1MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2024-10-11 12:52:27,677 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 245.4MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:52:27,678 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 100.7MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.86ms. Allocated memory is still 165.7MB. Free memory was 113.9MB in the beginning and 97.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.94ms. Allocated memory is still 165.7MB. Free memory was 97.2MB in the beginning and 93.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.25ms. Allocated memory is still 165.7MB. Free memory was 93.1MB in the beginning and 128.3MB in the end (delta: -35.3MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * RCFGBuilder took 537.81ms. Allocated memory is still 165.7MB. Free memory was 128.3MB in the beginning and 111.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3125.41ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 111.3MB in the beginning and 115.4MB in the end (delta: -4.1MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 245.4MB. Free memory is still 115.4MB. 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 someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed char var_1_3 = 1; [L24] signed char var_1_4 = 100; [L25] signed char var_1_5 = 5; [L26] signed char var_1_6 = 32; [L27] signed char var_1_7 = 32; [L28] unsigned short int var_1_8 = 8; [L29] unsigned short int var_1_10 = 21451; [L30] unsigned char var_1_12 = 8; [L31] unsigned short int var_1_13 = 16; [L32] unsigned short int var_1_16 = 53444; [L33] unsigned char var_1_17 = 0; [L34] unsigned char var_1_18 = 0; [L35] double var_1_19 = 1.2; [L36] signed char var_1_20 = 1; [L37] double var_1_21 = 10.5; [L38] double var_1_22 = 0.0; [L39] double var_1_23 = 10.4; [L40] double var_1_24 = 50.5; [L41] unsigned short int var_1_25 = 2; [L42] unsigned short int last_1_var_1_8 = 8; [L43] unsigned char last_1_var_1_12 = 8; [L44] unsigned short int last_1_var_1_13 = 16; [L45] unsigned char last_1_var_1_17 = 0; [L46] unsigned short int last_1_var_1_25 = 2; [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L122] last_1_var_1_8 = var_1_8 [L123] last_1_var_1_12 = var_1_12 [L124] last_1_var_1_13 = var_1_13 [L125] last_1_var_1_17 = var_1_17 [L126] last_1_var_1_25 = var_1_25 [L136] RET updateLastVariables() [L137] CALL updateVariables() [L85] var_1_3 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L86] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L87] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L87] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L88] var_1_4 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L89] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L90] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L90] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L92] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L95] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L96] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L96] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L99] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L99] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L101] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L102] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L102] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L103] var_1_16 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L104] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L105] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L105] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L106] var_1_18 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L107] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L108] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L108] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L109] var_1_20 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L111] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L111] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L113] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L114] var_1_22 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L115] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L116] var_1_23 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L117] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L118] var_1_24 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L119] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L137] RET updateVariables() [L138] CALL step() [L50] COND TRUE (last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17 [L51] var_1_25 = (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L55] COND TRUE ((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25) [L56] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L58] signed long int stepLocal_1 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_1=16, var_1_10=-163841, var_1_12=8, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L59] COND TRUE last_1_var_1_13 == stepLocal_1 [L60] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=63, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=8] [L62] var_1_8 = (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12)) [L63] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_0=-1000000, var_1_10=-163841, var_1_12=63, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] [L64] COND TRUE var_1_8 >= stepLocal_0 [L65] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=63, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] [L69] signed char stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_3=0, var_1_10=-163841, var_1_12=63, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] [L70] COND TRUE stepLocal_3 >= (var_1_5 - var_1_20) [L71] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=63, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] [L73] unsigned short int stepLocal_2 = var_1_25; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=71, var_1_10=-163841, var_1_12=63, var_1_13=16, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] [L74] COND FALSE !(\read(var_1_17)) [L81] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=71, var_1_10=-163841, var_1_12=63, var_1_13=0, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=63, var_1_13=0, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] [L129] EXPR var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=63, var_1_13=0, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] [L129] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=63, var_1_13=0, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] [L129-L130] return (((((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17) ? (var_1_25 == ((unsigned short int) (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=63, var_1_13=0, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-163841, var_1_12=63, var_1_13=0, var_1_16=-98305, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=71, var_1_3=0, var_1_4=0, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=32893] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 873 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 489 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 384 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 844 NumberOfCodeBlocks, 844 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 1437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3696/3696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:52:27,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-21.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdfa3058933baefd56be26cb7e27738d81c85b0fac7f1e9c4f346090174ee4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:52:29,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:52:29,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:52:29,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:52:29,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:52:29,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:52:29,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:52:29,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:52:29,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:52:29,641 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:52:29,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:52:29,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:52:29,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:52:29,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:52:29,643 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:52:29,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:52:29,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:52:29,644 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:52:29,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:52:29,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:52:29,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:52:29,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:52:29,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:52:29,645 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:52:29,645 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:52:29,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:52:29,646 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:52:29,646 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:52:29,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:52:29,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:52:29,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:52:29,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:52:29,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:52:29,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:52:29,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:52:29,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:52:29,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:52:29,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:52:29,648 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:52:29,648 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:52:29,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:52:29,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:52:29,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:52:29,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:52:29,649 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:52:29,650 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fdfa3058933baefd56be26cb7e27738d81c85b0fac7f1e9c4f346090174ee4b [2024-10-11 12:52:29,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:52:29,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:52:29,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:52:29,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:52:29,933 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:52:29,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-21.i [2024-10-11 12:52:31,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:52:31,407 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:52:31,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-21.i [2024-10-11 12:52:31,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a9027473a/9dc2525072b745579d5c1a916865febf/FLAGea2fef954 [2024-10-11 12:52:31,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a9027473a/9dc2525072b745579d5c1a916865febf [2024-10-11 12:52:31,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:52:31,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:52:31,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:52:31,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:52:31,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:52:31,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58135ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31, skipping insertion in model container [2024-10-11 12:52:31,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:52:31,623 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-21.i[915,928] [2024-10-11 12:52:31,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:52:31,705 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:52:31,716 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-21.i[915,928] [2024-10-11 12:52:31,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:52:31,772 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:52:31,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31 WrapperNode [2024-10-11 12:52:31,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:52:31,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:52:31,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:52:31,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:52:31,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,823 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-10-11 12:52:31,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:52:31,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:52:31,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:52:31,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:52:31,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,849 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:52:31,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:52:31,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:52:31,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:52:31,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:52:31,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (1/1) ... [2024-10-11 12:52:31,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:52:31,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:52:31,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:52:31,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:52:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:52:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:52:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:52:31,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:52:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:52:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:52:32,013 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:52:32,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:52:32,938 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 12:52:32,938 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:52:32,984 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:52:32,984 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:52:32,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:52:32 BoogieIcfgContainer [2024-10-11 12:52:32,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:52:32,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:52:32,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:52:32,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:52:32,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:52:31" (1/3) ... [2024-10-11 12:52:32,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17242357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:52:32, skipping insertion in model container [2024-10-11 12:52:32,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:52:31" (2/3) ... [2024-10-11 12:52:32,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17242357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:52:32, skipping insertion in model container [2024-10-11 12:52:32,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:52:32" (3/3) ... [2024-10-11 12:52:32,992 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-21.i [2024-10-11 12:52:33,004 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:52:33,005 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:52:33,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:52:33,076 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;@2cc6cac4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:52:33,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:52:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 12:52:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 12:52:33,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:52:33,091 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:52:33,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:52:33,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:52:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash -663275736, now seen corresponding path program 1 times [2024-10-11 12:52:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:52:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577108071] [2024-10-11 12:52:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:52:33,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:52:33,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:52:33,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:52:33,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:52:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:33,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:52:33,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:52:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-11 12:52:33,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:52:33,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:52:33,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577108071] [2024-10-11 12:52:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577108071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:52:33,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:52:33,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:52:33,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291865671] [2024-10-11 12:52:33,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:52:33,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:52:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:52:33,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:52:33,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:52:33,459 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 12:52:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:52:33,903 INFO L93 Difference]: Finished difference Result 115 states and 200 transitions. [2024-10-11 12:52:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:52:33,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2024-10-11 12:52:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:52:33,923 INFO L225 Difference]: With dead ends: 115 [2024-10-11 12:52:33,923 INFO L226 Difference]: Without dead ends: 57 [2024-10-11 12:52:33,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:52:33,928 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:52:33,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:52:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-11 12:52:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-11 12:52:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 12:52:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2024-10-11 12:52:33,959 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 138 [2024-10-11 12:52:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:52:33,959 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2024-10-11 12:52:33,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 12:52:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2024-10-11 12:52:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 12:52:33,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:52:33,961 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:52:33,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 12:52:34,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:52:34,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:52:34,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:52:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash -526647440, now seen corresponding path program 1 times [2024-10-11 12:52:34,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:52:34,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074895677] [2024-10-11 12:52:34,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:52:34,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:52:34,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:52:34,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:52:34,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:52:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:52:34,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 12:52:34,676 INFO L278 TraceCheckSpWp]: Computing forward predicates...