./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-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:52:29,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:52:29,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:52:29,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:52:29,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:52:29,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:52:29,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:52:29,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:52:29,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:52:29,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:52:29,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:52:29,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:52:29,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:52:29,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:52:29,945 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:52:29,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:52:29,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:52:29,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:52:29,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:52:29,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:52:29,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:52:29,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:52:29,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:52:29,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:52:29,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:52:29,948 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:52:29,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:52:29,949 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:52:29,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:52:29,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:52:29,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:52:29,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:52:29,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:52:29,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:52:29,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:52:29,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:52:29,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:52:29,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:52:29,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:52:29,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:52:29,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:52:29,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:52:29,952 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 [2024-10-24 10:52:30,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:52:30,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:52:30,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:52:30,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:52:30,161 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:52:30,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-10-24 10:52:31,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:52:31,733 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:52:31,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-10-24 10:52:31,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfc1f6b8/743755f55c0f4d01950729ce8924bc47/FLAG9dc3dc5b0 [2024-10-24 10:52:32,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfc1f6b8/743755f55c0f4d01950729ce8924bc47 [2024-10-24 10:52:32,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:52:32,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:52:32,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:52:32,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:52:32,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:52:32,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@444f8e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32, skipping insertion in model container [2024-10-24 10:52:32,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:52:32,293 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-29.i[915,928] [2024-10-24 10:52:32,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:52:32,360 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:52:32,369 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-29.i[915,928] [2024-10-24 10:52:32,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:52:32,476 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:52:32,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32 WrapperNode [2024-10-24 10:52:32,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:52:32,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:52:32,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:52:32,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:52:32,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,530 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2024-10-24 10:52:32,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:52:32,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:52:32,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:52:32,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:52:32,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,572 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-24 10:52:32,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:52:32,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:52:32,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:52:32,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:52:32,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (1/1) ... [2024-10-24 10:52:32,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:52:32,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:52:32,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:52:32,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:52:32,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:52:32,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:52:32,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:52:32,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:52:32,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:52:32,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:52:32,723 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:52:32,725 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:52:32,988 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:52:32,988 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:52:33,029 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:52:33,029 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:52:33,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:52:33 BoogieIcfgContainer [2024-10-24 10:52:33,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:52:33,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:52:33,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:52:33,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:52:33,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:52:32" (1/3) ... [2024-10-24 10:52:33,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665e7bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:52:33, skipping insertion in model container [2024-10-24 10:52:33,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:32" (2/3) ... [2024-10-24 10:52:33,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665e7bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:52:33, skipping insertion in model container [2024-10-24 10:52:33,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:52:33" (3/3) ... [2024-10-24 10:52:33,037 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-29.i [2024-10-24 10:52:33,051 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:52:33,051 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:52:33,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:52:33,118 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;@47992a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:52:33,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:52:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 10:52:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 10:52:33,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:52:33,133 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:52:33,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:52:33,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:52:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash 916860293, now seen corresponding path program 1 times [2024-10-24 10:52:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:52:33,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109967584] [2024-10-24 10:52:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:33,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:52:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:52:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:52:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:52:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:52:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:52:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:52:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:52:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:52:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:52:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:52:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:52:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:52:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:52:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:52:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:52:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:52:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:52:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 10:52:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 10:52:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 10:52:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 10:52:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 10:52:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 10:52:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 10:52:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 10:52:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 10:52:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 10:52:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 10:52:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 10:52:33,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:52:33,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109967584] [2024-10-24 10:52:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109967584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:52:33,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:52:33,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:52:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293952052] [2024-10-24 10:52:33,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:52:33,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:52:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:52:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:52:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:52:33,902 INFO L87 Difference]: Start difference. First operand has 66 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 10:52:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:52:33,991 INFO L93 Difference]: Finished difference Result 192 states and 370 transitions. [2024-10-24 10:52:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:52:33,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 166 [2024-10-24 10:52:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:52:34,005 INFO L225 Difference]: With dead ends: 192 [2024-10-24 10:52:34,009 INFO L226 Difference]: Without dead ends: 127 [2024-10-24 10:52:34,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-24 10:52:34,022 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:52:34,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 192 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:52:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-24 10:52:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-10-24 10:52:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 10:52:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 199 transitions. [2024-10-24 10:52:34,122 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 199 transitions. Word has length 166 [2024-10-24 10:52:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:52:34,130 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 199 transitions. [2024-10-24 10:52:34,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 10:52:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 199 transitions. [2024-10-24 10:52:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 10:52:34,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:52:34,138 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:52:34,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:52:34,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:52:34,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:52:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash 918707335, now seen corresponding path program 1 times [2024-10-24 10:52:34,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:52:34,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270755448] [2024-10-24 10:52:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:52:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:52:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:52:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:52:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:52:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:52:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:52:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:52:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:52:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:52:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:52:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:52:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:52:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:52:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:52:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:52:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:52:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:52:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 10:52:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 10:52:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 10:52:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 10:52:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 10:52:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 10:52:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 10:52:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 10:52:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 10:52:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 10:52:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 10:52:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 10:52:34,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:52:34,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270755448] [2024-10-24 10:52:34,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270755448] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:52:34,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494943304] [2024-10-24 10:52:34,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:34,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:52:34,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:52:34,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:52:34,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 10:52:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:34,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 10:52:34,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:52:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 929 proven. 12 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-10-24 10:52:35,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:52:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 10:52:35,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494943304] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:52:35,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 10:52:35,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-24 10:52:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881592348] [2024-10-24 10:52:35,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 10:52:35,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 10:52:35,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:52:35,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 10:52:35,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 10:52:35,477 INFO L87 Difference]: Start difference. First operand 125 states and 199 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) [2024-10-24 10:52:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:52:35,801 INFO L93 Difference]: Finished difference Result 261 states and 407 transitions. [2024-10-24 10:52:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 10:52:35,802 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) Word has length 166 [2024-10-24 10:52:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:52:35,804 INFO L225 Difference]: With dead ends: 261 [2024-10-24 10:52:35,804 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 10:52:35,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-10-24 10:52:35,806 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 93 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:52:35,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 161 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:52:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 10:52:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-10-24 10:52:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 10:52:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2024-10-24 10:52:35,825 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 166 [2024-10-24 10:52:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:52:35,825 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2024-10-24 10:52:35,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) [2024-10-24 10:52:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2024-10-24 10:52:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 10:52:35,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:52:35,829 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:52:35,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 10:52:36,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:52:36,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:52:36,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:52:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 954182016, now seen corresponding path program 1 times [2024-10-24 10:52:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:52:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759236889] [2024-10-24 10:52:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:36,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:52:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 10:52:36,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [721750690] [2024-10-24 10:52:36,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:36,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:52:36,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:52:36,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:52:36,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 10:52:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:52:36,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:52:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:52:36,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:52:36,349 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:52:36,350 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:52:36,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 10:52:36,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 10:52:36,557 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 10:52:36,640 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:52:36,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:52:36 BoogieIcfgContainer [2024-10-24 10:52:36,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:52:36,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:52:36,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:52:36,648 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:52:36,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:52:33" (3/4) ... [2024-10-24 10:52:36,656 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:52:36,658 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:52:36,658 INFO L158 Benchmark]: Toolchain (without parser) took 4561.67ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 66.8MB in the beginning and 106.2MB in the end (delta: -39.4MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2024-10-24 10:52:36,658 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 138.4MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:52:36,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.75ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 66.6MB in the beginning and 158.4MB in the end (delta: -91.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-10-24 10:52:36,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.78ms. Allocated memory is still 188.7MB. Free memory was 158.4MB in the beginning and 155.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:52:36,659 INFO L158 Benchmark]: Boogie Preprocessor took 61.20ms. Allocated memory is still 188.7MB. Free memory was 155.5MB in the beginning and 153.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:52:36,659 INFO L158 Benchmark]: RCFGBuilder took 436.68ms. Allocated memory is still 188.7MB. Free memory was 152.2MB in the beginning and 130.3MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 10:52:36,659 INFO L158 Benchmark]: TraceAbstraction took 3615.62ms. Allocated memory was 188.7MB in the beginning and 243.3MB in the end (delta: 54.5MB). Free memory was 129.2MB in the beginning and 106.2MB in the end (delta: 23.0MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2024-10-24 10:52:36,659 INFO L158 Benchmark]: Witness Printer took 9.98ms. Allocated memory is still 243.3MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:52:36,660 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 138.4MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.75ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 66.6MB in the beginning and 158.4MB in the end (delta: -91.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.78ms. Allocated memory is still 188.7MB. Free memory was 158.4MB in the beginning and 155.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.20ms. Allocated memory is still 188.7MB. Free memory was 155.5MB in the beginning and 153.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.68ms. Allocated memory is still 188.7MB. Free memory was 152.2MB in the beginning and 130.3MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3615.62ms. Allocated memory was 188.7MB in the beginning and 243.3MB in the end (delta: 54.5MB). Free memory was 129.2MB in the beginning and 106.2MB in the end (delta: 23.0MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. * Witness Printer took 9.98ms. Allocated memory is still 243.3MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L88] var_1_6 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] var_1_9 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L95] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L96] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L96] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L97] var_1_10 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L98] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L99] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L99] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L100] var_1_12 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L101] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L103] var_1_13 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L104] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L106] var_1_14 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L107] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L108] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L108] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L109] var_1_15 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L111] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L111] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L112] var_1_16 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L114] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L114] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L115] var_1_17 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L116] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L118] var_1_19 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L119] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L122] var_1_22 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L123] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L125] var_1_24 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L126] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L127] var_1_25 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L128] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L129] var_1_26 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L130] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L143] RET updateVariables() [L144] CALL step() [L47] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L48] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L49] COND TRUE var_1_10 <= var_1_17 [L50] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L55] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L56] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L58] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L63] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L64] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L68] COND FALSE !(\read(var_1_18)) [L71] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L73] COND TRUE \read(var_1_1) [L74] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 255 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 158 mSDtfsCounter, 255 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 832 NumberOfCodeBlocks, 832 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 1283 SizeOfPredicates, 3 NumberOfNonLiveVariables, 371 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6012/6048 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-24 10:52:36,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:52:38,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:52:38,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:52:38,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:52:38,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:52:38,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:52:38,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:52:38,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:52:38,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:52:38,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:52:38,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:52:38,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:52:38,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:52:38,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:52:38,970 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:52:38,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:52:38,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:52:38,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:52:38,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:52:38,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:52:38,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:52:38,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:52:38,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:52:38,973 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:52:38,973 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:52:38,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:52:38,974 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:52:38,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:52:38,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:52:38,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:52:38,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:52:38,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:52:38,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:52:38,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:52:38,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:52:38,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:52:38,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:52:38,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:52:38,982 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:52:38,982 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:52:38,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:52:38,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:52:38,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:52:38,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:52:38,987 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:52:38,987 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 [2024-10-24 10:52:39,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:52:39,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:52:39,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:52:39,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:52:39,542 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:52:39,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-10-24 10:52:41,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:52:41,173 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:52:41,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-10-24 10:52:41,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3cfa557e/1f4d1d16468a417dbba324ada0ea4421/FLAG20ca7929f [2024-10-24 10:52:41,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3cfa557e/1f4d1d16468a417dbba324ada0ea4421 [2024-10-24 10:52:41,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:52:41,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:52:41,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:52:41,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:52:41,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:52:41,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39bcc160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41, skipping insertion in model container [2024-10-24 10:52:41,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:52:41,380 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-29.i[915,928] [2024-10-24 10:52:41,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:52:41,453 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:52:41,463 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-29.i[915,928] [2024-10-24 10:52:41,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:52:41,521 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:52:41,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41 WrapperNode [2024-10-24 10:52:41,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:52:41,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:52:41,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:52:41,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:52:41,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,575 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-10-24 10:52:41,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:52:41,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:52:41,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:52:41,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:52:41,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,599 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-24 10:52:41,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:52:41,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:52:41,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:52:41,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:52:41,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (1/1) ... [2024-10-24 10:52:41,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:52:41,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:52:41,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:52:41,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:52:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:52:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:52:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:52:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:52:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:52:41,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:52:41,758 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:52:41,761 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:52:44,154 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:52:44,155 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:52:44,200 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:52:44,200 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:52:44,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:52:44 BoogieIcfgContainer [2024-10-24 10:52:44,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:52:44,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:52:44,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:52:44,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:52:44,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:52:41" (1/3) ... [2024-10-24 10:52:44,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1662846b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:52:44, skipping insertion in model container [2024-10-24 10:52:44,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:52:41" (2/3) ... [2024-10-24 10:52:44,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1662846b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:52:44, skipping insertion in model container [2024-10-24 10:52:44,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:52:44" (3/3) ... [2024-10-24 10:52:44,207 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-29.i [2024-10-24 10:52:44,233 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:52:44,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:52:44,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:52:44,299 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;@60bb681a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:52:44,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:52:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 10:52:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 10:52:44,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:52:44,320 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:52:44,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:52:44,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:52:44,327 INFO L85 PathProgramCache]: Analyzing trace with hash 916860293, now seen corresponding path program 1 times [2024-10-24 10:52:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:52:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199076723] [2024-10-24 10:52:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:44,341 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-24 10:52:44,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:52:44,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:52:44,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 10:52:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:44,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 10:52:44,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:52:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-24 10:52:44,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:52:44,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:52:44,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199076723] [2024-10-24 10:52:44,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199076723] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:52:44,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [473549663] [2024-10-24 10:52:44,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:44,915 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 10:52:44,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 10:52:44,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 10:52:44,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-10-24 10:52:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:45,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 10:52:45,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:52:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 10:52:45,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:52:45,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [473549663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:52:45,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 10:52:45,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-24 10:52:45,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138099782] [2024-10-24 10:52:45,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:52:45,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:52:45,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:52:45,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:52:45,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:52:45,878 INFO L87 Difference]: Start difference. First operand has 66 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 10:52:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:52:46,745 INFO L93 Difference]: Finished difference Result 192 states and 370 transitions. [2024-10-24 10:52:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:52:46,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 166 [2024-10-24 10:52:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:52:46,759 INFO L225 Difference]: With dead ends: 192 [2024-10-24 10:52:46,759 INFO L226 Difference]: Without dead ends: 127 [2024-10-24 10:52:46,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:52:46,767 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 10:52:46,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 192 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 10:52:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-24 10:52:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-10-24 10:52:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 10:52:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 199 transitions. [2024-10-24 10:52:46,819 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 199 transitions. Word has length 166 [2024-10-24 10:52:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:52:46,820 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 199 transitions. [2024-10-24 10:52:46,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 10:52:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 199 transitions. [2024-10-24 10:52:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 10:52:46,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:52:46,823 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:52:46,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 10:52:47,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-10-24 10:52:47,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 10:52:47,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:52:47,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:52:47,228 INFO L85 PathProgramCache]: Analyzing trace with hash 918707335, now seen corresponding path program 1 times [2024-10-24 10:52:47,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:52:47,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782614389] [2024-10-24 10:52:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:47,229 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-24 10:52:47,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:52:47,232 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:52:47,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 10:52:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:47,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 10:52:47,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:52:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-24 10:52:47,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:52:47,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:52:47,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782614389] [2024-10-24 10:52:47,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782614389] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:52:47,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1765564067] [2024-10-24 10:52:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:47,742 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 10:52:47,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 10:52:47,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 10:52:47,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-24 10:52:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:48,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 10:52:48,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:52:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 10:52:48,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:52:48,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1765564067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:52:48,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 10:52:48,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-24 10:52:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775192098] [2024-10-24 10:52:48,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:52:48,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:52:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:52:48,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:52:48,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:52:48,434 INFO L87 Difference]: Start difference. First operand 125 states and 199 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 10:52:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:52:49,856 INFO L93 Difference]: Finished difference Result 371 states and 591 transitions. [2024-10-24 10:52:49,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:52:49,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 166 [2024-10-24 10:52:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:52:49,866 INFO L225 Difference]: With dead ends: 371 [2024-10-24 10:52:49,870 INFO L226 Difference]: Without dead ends: 247 [2024-10-24 10:52:49,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:52:49,877 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 93 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:52:49,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 268 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 10:52:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-24 10:52:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2024-10-24 10:52:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 128 states have (on average 1.28125) internal successors, (164), 128 states have internal predecessors, (164), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-24 10:52:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 388 transitions. [2024-10-24 10:52:49,988 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 388 transitions. Word has length 166 [2024-10-24 10:52:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:52:49,991 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 388 transitions. [2024-10-24 10:52:49,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 10:52:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 388 transitions. [2024-10-24 10:52:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 10:52:49,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:52:49,994 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:52:50,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 10:52:50,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-10-24 10:52:50,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 10:52:50,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:52:50,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:52:50,400 INFO L85 PathProgramCache]: Analyzing trace with hash 975965637, now seen corresponding path program 1 times [2024-10-24 10:52:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:52:50,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760114924] [2024-10-24 10:52:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:50,404 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-24 10:52:50,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:52:50,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:52:50,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 10:52:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:50,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 10:52:50,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:52:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-24 10:52:50,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:52:50,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:52:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760114924] [2024-10-24 10:52:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760114924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:52:50,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [650284713] [2024-10-24 10:52:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:50,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 10:52:50,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 10:52:50,858 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 10:52:50,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-24 10:52:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:51,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 10:52:51,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:52:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-24 10:52:52,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:52:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 10:52:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [650284713] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:52:52,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 10:52:52,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-10-24 10:52:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731962082] [2024-10-24 10:52:52,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 10:52:52,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 10:52:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:52:52,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 10:52:52,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 10:52:52,675 INFO L87 Difference]: Start difference. First operand 245 states and 388 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-10-24 10:53:02,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 10:53:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:53:06,349 INFO L93 Difference]: Finished difference Result 679 states and 1030 transitions. [2024-10-24 10:53:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-24 10:53:06,351 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 166 [2024-10-24 10:53:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:53:06,359 INFO L225 Difference]: With dead ends: 679 [2024-10-24 10:53:06,360 INFO L226 Difference]: Without dead ends: 435 [2024-10-24 10:53:06,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 10:53:06,363 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 394 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-10-24 10:53:06,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 284 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-10-24 10:53:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-24 10:53:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 281. [2024-10-24 10:53:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 156 states have (on average 1.2179487179487178) internal successors, (190), 156 states have internal predecessors, (190), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-24 10:53:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 414 transitions. [2024-10-24 10:53:06,427 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 414 transitions. Word has length 166 [2024-10-24 10:53:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:53:06,428 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 414 transitions. [2024-10-24 10:53:06,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-10-24 10:53:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 414 transitions. [2024-10-24 10:53:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 10:53:06,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:53:06,434 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:53:06,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-24 10:53:06,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 10:53:06,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:53:06,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:53:06,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:53:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1011440318, now seen corresponding path program 1 times [2024-10-24 10:53:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:53:06,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328408151] [2024-10-24 10:53:06,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:53:06,838 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-24 10:53:06,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:53:06,839 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:53:06,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 10:53:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:53:07,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 10:53:07,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:53:19,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from false [2024-10-24 10:53:23,402 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true