./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_loopvsstraightlinecode_50-while_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-94.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 1a2614a5d86037480b02d6a9728d38921bae1f55257b3575da577dd0cc2aa974 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:47:06,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:47:06,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:47:06,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:47:06,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:47:06,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:47:06,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:47:06,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:47:06,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:47:06,669 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:47:06,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:47:06,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:47:06,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:47:06,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:47:06,672 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:47:06,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:47:06,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:47:06,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:47:06,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:47:06,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:47:06,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:47:06,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:47:06,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:47:06,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:47:06,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:47:06,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:47:06,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:47:06,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:47:06,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:47:06,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:47:06,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:47:06,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:47:06,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:06,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:47:06,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:47:06,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:47:06,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:47:06,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:47:06,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:47:06,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:47:06,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:47:06,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:47:06,684 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 -> 1a2614a5d86037480b02d6a9728d38921bae1f55257b3575da577dd0cc2aa974 [2024-10-13 04:47:06,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:47:06,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:47:06,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:47:06,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:47:06,928 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:47:06,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-94.i [2024-10-13 04:47:08,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:47:08,762 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:47:08,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-94.i [2024-10-13 04:47:08,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b898613b/c28fdd87bd2e4230832c64f07bc48a9e/FLAG8ad9886ea [2024-10-13 04:47:09,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b898613b/c28fdd87bd2e4230832c64f07bc48a9e [2024-10-13 04:47:09,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:47:09,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:47:09,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:09,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:47:09,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:47:09,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffc74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09, skipping insertion in model container [2024-10-13 04:47:09,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:47:09,328 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_loopvsstraightlinecode_50-while_file-94.i[915,928] [2024-10-13 04:47:09,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:09,420 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:47:09,433 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_loopvsstraightlinecode_50-while_file-94.i[915,928] [2024-10-13 04:47:09,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:09,521 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:47:09,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09 WrapperNode [2024-10-13 04:47:09,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:09,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:09,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:47:09,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:47:09,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,601 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-10-13 04:47:09,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:09,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:47:09,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:47:09,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:47:09,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,641 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:47:09,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:47:09,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:47:09,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:47:09,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:47:09,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (1/1) ... [2024-10-13 04:47:09,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:09,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:09,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:47:09,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:47:09,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:47:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:47:09,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:47:09,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:47:09,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:47:09,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:47:09,866 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:47:09,869 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:47:10,196 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 04:47:10,196 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:47:10,231 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:47:10,232 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:47:10,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:10 BoogieIcfgContainer [2024-10-13 04:47:10,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:47:10,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:47:10,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:47:10,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:47:10,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:47:09" (1/3) ... [2024-10-13 04:47:10,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b72b04a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:47:10, skipping insertion in model container [2024-10-13 04:47:10,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:09" (2/3) ... [2024-10-13 04:47:10,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b72b04a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:47:10, skipping insertion in model container [2024-10-13 04:47:10,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:10" (3/3) ... [2024-10-13 04:47:10,240 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-94.i [2024-10-13 04:47:10,254 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:47:10,254 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:47:10,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:47:10,348 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;@2f0b0526, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:47:10,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:47:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 04:47:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 04:47:10,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:10,381 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:10,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash -387117862, now seen corresponding path program 1 times [2024-10-13 04:47:10,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419107697] [2024-10-13 04:47:10,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:47:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:47:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:47:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:47:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:47:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:47:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:47:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:47:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:47:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:47:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:47:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:47:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:47:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:47:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 04:47:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:47:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:47:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 04:47:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:47:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 04:47:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:47:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 04:47:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 04:47:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 04:47:10,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:10,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419107697] [2024-10-13 04:47:10,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419107697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:10,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:10,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:47:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983627634] [2024-10-13 04:47:10,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:10,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:47:10,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:10,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:47:10,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:47:10,972 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 04:47:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:11,026 INFO L93 Difference]: Finished difference Result 139 states and 245 transitions. [2024-10-13 04:47:11,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:47:11,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 166 [2024-10-13 04:47:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:11,040 INFO L225 Difference]: With dead ends: 139 [2024-10-13 04:47:11,041 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 04:47:11,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:47:11,050 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:11,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:47:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 04:47:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 04:47:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 04:47:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2024-10-13 04:47:11,175 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 166 [2024-10-13 04:47:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:11,177 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2024-10-13 04:47:11,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 04:47:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2024-10-13 04:47:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 04:47:11,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:11,182 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:11,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:47:11,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:11,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:11,184 INFO L85 PathProgramCache]: Analyzing trace with hash 813548556, now seen corresponding path program 1 times [2024-10-13 04:47:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:11,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801614704] [2024-10-13 04:47:11,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:11,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:47:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:47:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:47:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:47:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:47:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:47:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:47:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:47:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:47:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:47:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:47:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:47:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:47:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:47:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 04:47:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:47:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:47:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 04:47:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:47:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 04:47:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:47:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 04:47:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 04:47:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 04:47:11,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:11,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801614704] [2024-10-13 04:47:11,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801614704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:11,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:47:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625931789] [2024-10-13 04:47:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:11,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:47:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:11,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:47:11,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:47:11,728 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 04:47:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:11,793 INFO L93 Difference]: Finished difference Result 205 states and 313 transitions. [2024-10-13 04:47:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:47:11,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 166 [2024-10-13 04:47:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:11,797 INFO L225 Difference]: With dead ends: 205 [2024-10-13 04:47:11,799 INFO L226 Difference]: Without dead ends: 137 [2024-10-13 04:47:11,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:47:11,801 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:11,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 204 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:47:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-13 04:47:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-10-13 04:47:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 04:47:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2024-10-13 04:47:11,838 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 166 [2024-10-13 04:47:11,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:11,838 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2024-10-13 04:47:11,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 04:47:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2024-10-13 04:47:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 04:47:11,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:11,843 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:11,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:47:11,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:11,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2098977014, now seen corresponding path program 1 times [2024-10-13 04:47:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:11,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933260220] [2024-10-13 04:47:11,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:11,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:47:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:47:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:47:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:47:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:47:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:47:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:47:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:47:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:47:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:47:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:47:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:47:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:47:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:47:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 04:47:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:47:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:47:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 04:47:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:47:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 04:47:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:47:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 04:47:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 04:47:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 04:47:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933260220] [2024-10-13 04:47:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933260220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:12,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:47:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478967197] [2024-10-13 04:47:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:12,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:47:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:12,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:47:12,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:47:12,460 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 04:47:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:12,655 INFO L93 Difference]: Finished difference Result 435 states and 661 transitions. [2024-10-13 04:47:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:47:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2024-10-13 04:47:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:12,662 INFO L225 Difference]: With dead ends: 435 [2024-10-13 04:47:12,663 INFO L226 Difference]: Without dead ends: 302 [2024-10-13 04:47:12,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:47:12,665 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 99 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:12,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 311 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:47:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-13 04:47:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 290. [2024-10-13 04:47:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 177 states have (on average 1.265536723163842) internal successors, (224), 177 states have internal predecessors, (224), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 04:47:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 440 transitions. [2024-10-13 04:47:12,730 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 440 transitions. Word has length 167 [2024-10-13 04:47:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:12,731 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 440 transitions. [2024-10-13 04:47:12,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 04:47:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 440 transitions. [2024-10-13 04:47:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-13 04:47:12,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:12,736 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:12,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:47:12,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:12,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash -38574110, now seen corresponding path program 1 times [2024-10-13 04:47:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:12,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765935541] [2024-10-13 04:47:12,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:12,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:47:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:47:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:47:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:47:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:47:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:47:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:47:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:47:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:47:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:47:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:47:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:47:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:47:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:47:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:47:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:47:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:47:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:47:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 04:47:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:47:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:47:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 04:47:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:47:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 04:47:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:47:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 04:47:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 04:47:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 04:47:13,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:47:13,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765935541] [2024-10-13 04:47:13,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765935541] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:47:13,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882768501] [2024-10-13 04:47:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:13,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:47:13,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:13,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:47:13,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:47:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:13,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:47:13,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:47:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-13 04:47:13,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:47:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 04:47:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882768501] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:47:14,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:47:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-13 04:47:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616379754] [2024-10-13 04:47:14,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:47:14,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 04:47:14,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:47:14,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 04:47:14,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:47:14,382 INFO L87 Difference]: Start difference. First operand 290 states and 440 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-13 04:47:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:14,948 INFO L93 Difference]: Finished difference Result 921 states and 1371 transitions. [2024-10-13 04:47:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 04:47:14,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 169 [2024-10-13 04:47:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:14,955 INFO L225 Difference]: With dead ends: 921 [2024-10-13 04:47:14,955 INFO L226 Difference]: Without dead ends: 632 [2024-10-13 04:47:14,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 389 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2024-10-13 04:47:14,957 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 175 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:14,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 341 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:47:14,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-10-13 04:47:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 306. [2024-10-13 04:47:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 189 states have (on average 1.216931216931217) internal successors, (230), 189 states have internal predecessors, (230), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 04:47:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 446 transitions. [2024-10-13 04:47:15,016 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 446 transitions. Word has length 169 [2024-10-13 04:47:15,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:15,017 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 446 transitions. [2024-10-13 04:47:15,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-13 04:47:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 446 transitions. [2024-10-13 04:47:15,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-13 04:47:15,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:15,019 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:15,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 04:47:15,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:47:15,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:15,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash -625380124, now seen corresponding path program 1 times [2024-10-13 04:47:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:47:15,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859756427] [2024-10-13 04:47:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:15,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:47:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:47:15,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790639414] [2024-10-13 04:47:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:15,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:47:15,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:15,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:47:15,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 04:47:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:47:15,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:47:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:47:15,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:47:15,767 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:47:15,768 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:47:15,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 04:47:15,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:47:15,977 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 04:47:16,083 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:47:16,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:47:16 BoogieIcfgContainer [2024-10-13 04:47:16,086 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:47:16,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:47:16,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:47:16,086 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:47:16,087 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:10" (3/4) ... [2024-10-13 04:47:16,088 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:47:16,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:47:16,089 INFO L158 Benchmark]: Toolchain (without parser) took 6935.93ms. Allocated memory was 159.4MB in the beginning and 283.1MB in the end (delta: 123.7MB). Free memory was 88.3MB in the beginning and 97.2MB in the end (delta: -8.9MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. [2024-10-13 04:47:16,090 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:47:16,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.97ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 88.1MB in the beginning and 191.8MB in the end (delta: -103.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-10-13 04:47:16,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.00ms. Allocated memory is still 222.3MB. Free memory was 190.7MB in the beginning and 186.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:47:16,090 INFO L158 Benchmark]: Boogie Preprocessor took 85.66ms. Allocated memory is still 222.3MB. Free memory was 186.5MB in the beginning and 179.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:47:16,090 INFO L158 Benchmark]: RCFGBuilder took 543.33ms. Allocated memory is still 222.3MB. Free memory was 179.2MB in the beginning and 149.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 04:47:16,091 INFO L158 Benchmark]: TraceAbstraction took 5851.86ms. Allocated memory was 222.3MB in the beginning and 283.1MB in the end (delta: 60.8MB). Free memory was 149.8MB in the beginning and 98.2MB in the end (delta: 51.6MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. [2024-10-13 04:47:16,091 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 283.1MB. Free memory was 98.2MB in the beginning and 97.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:47:16,092 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.14ms. Allocated memory is still 159.4MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.97ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 88.1MB in the beginning and 191.8MB in the end (delta: -103.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.00ms. Allocated memory is still 222.3MB. Free memory was 190.7MB in the beginning and 186.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.66ms. Allocated memory is still 222.3MB. Free memory was 186.5MB in the beginning and 179.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 543.33ms. Allocated memory is still 222.3MB. Free memory was 179.2MB in the beginning and 149.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5851.86ms. Allocated memory was 222.3MB in the beginning and 283.1MB in the end (delta: 60.8MB). Free memory was 149.8MB in the beginning and 98.2MB in the end (delta: 51.6MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 283.1MB. Free memory was 98.2MB in the beginning and 97.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of shiftLeft at line 138, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 1; [L24] unsigned char var_1_6 = 1; [L25] unsigned char var_1_7 = 0; [L26] signed long int var_1_8 = 50; [L27] double var_1_9 = 32.7; [L28] double var_1_10 = 64.25; [L29] double var_1_11 = 10.3; [L30] double var_1_12 = 3.3; [L31] double var_1_13 = 16.5; [L32] double var_1_14 = 7.125; [L33] unsigned short int var_1_15 = 50; [L34] unsigned short int var_1_16 = 16; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 64; [L37] unsigned long int var_1_19 = 16; [L38] signed short int var_1_20 = 100; [L39] signed short int var_1_21 = 2; [L40] signed short int var_1_22 = 8; [L41] signed long int var_1_23 = -4; [L42] unsigned short int var_1_24 = 128; [L43] signed long int var_1_25 = 2; [L44] unsigned short int var_1_26 = 256; [L45] unsigned char var_1_27 = 0; [L46] signed long int last_1_var_1_8 = 50; [L47] unsigned long int last_1_var_1_19 = 16; [L48] unsigned char last_1_var_1_27 = 0; [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] CALL updateLastVariables() [L133] last_1_var_1_8 = var_1_8 [L134] last_1_var_1_19 = var_1_19 [L135] last_1_var_1_27 = var_1_27 [L145] RET updateLastVariables() [L146] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L90] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L91] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L91] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L92] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L92] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L93] var_1_6 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L94] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L95] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L95] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L96] var_1_7 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_8=50, var_1_9=327/10] [L97] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_8=50, var_1_9=327/10] [L98] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L98] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L99] var_1_10 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L100] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L101] var_1_11 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L102] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L103] var_1_12 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L104] RET assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L105] var_1_13 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L106] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L107] var_1_14 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L109] var_1_16 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L110] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L111] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L111] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L112] var_1_17 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L113] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L114] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L114] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L115] var_1_18 = __VERIFIER_nondet_ushort() [L116] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L116] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L117] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L117] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L118] var_1_20 = __VERIFIER_nondet_short() [L119] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L119] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L120] CALL assume_abort_if_not(var_1_20 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L120] RET assume_abort_if_not(var_1_20 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L121] var_1_21 = __VERIFIER_nondet_short() [L122] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L122] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L123] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L123] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L124] var_1_22 = __VERIFIER_nondet_short() [L125] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L125] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L126] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L126] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L127] var_1_24 = __VERIFIER_nondet_ushort() [L128] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L128] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L129] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L129] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L130] CALL assume_abort_if_not(var_1_24 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L130] RET assume_abort_if_not(var_1_24 != 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L146] RET updateVariables() [L147] CALL step() [L52] EXPR -1 << last_1_var_1_19 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L52] signed long int stepLocal_1 = -1 << last_1_var_1_19; [L53] unsigned long int stepLocal_0 = -1000000000 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, stepLocal_0=-999999984, stepLocal_1=8, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L54] COND TRUE stepLocal_1 < var_1_3 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, stepLocal_0=-999999984, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L55] COND FALSE !((last_1_var_1_19 / var_1_3) > stepLocal_0) [L58] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L61] var_1_9 = (((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) + (var_1_12 + (var_1_13 - var_1_14))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50] [L62] COND TRUE var_1_10 >= var_1_11 [L63] var_1_15 = ((((((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) > (var_1_18)) ? (((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) : (var_1_18))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50] [L65] var_1_25 = -256 [L66] var_1_26 = var_1_17 [L67] var_1_27 = var_1_6 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50] [L68] COND FALSE !(var_1_7 || var_1_1) [L79] var_1_8 = last_1_var_1_8 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=-4, var_1_24=65540, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50] [L81] COND TRUE var_1_6 || (var_1_16 <= (var_1_22 / var_1_24)) [L82] var_1_23 = (((((var_1_8 + (var_1_21 + var_1_24))) < (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((var_1_8 + (var_1_21 + var_1_24))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=2, var_1_24=65540, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50] [L84] COND TRUE (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23 [L85] var_1_19 = ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=2, var_1_1=0, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=2, var_1_24=65540, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50] [L147] RET step() [L148] CALL, EXPR property() [L138] EXPR -1 << last_1_var_1_19 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=2, var_1_1=0, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=2, var_1_24=65540, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50] [L138-L139] return ((((((((((-1 << last_1_var_1_19) < var_1_3) ? (((last_1_var_1_19 / var_1_3) > (-1000000000 + last_1_var_1_19)) ? (var_1_1 == ((unsigned char) (last_1_var_1_27 || var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) : 1) && ((var_1_7 || var_1_1) ? (((var_1_26 >= var_1_3) && var_1_1) ? (var_1_8 == ((signed long int) ((((var_1_3) < (var_1_26)) ? (var_1_3) : (var_1_26))))) : (var_1_1 ? (var_1_8 == ((signed long int) last_1_var_1_8)) : (var_1_8 == ((signed long int) last_1_var_1_8)))) : (var_1_8 == ((signed long int) last_1_var_1_8)))) && (var_1_9 == ((double) (((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) + (var_1_12 + (var_1_13 - var_1_14)))))) && ((var_1_10 >= var_1_11) ? (var_1_15 == ((unsigned short int) ((((((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) > (var_1_18)) ? (((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) : (var_1_18))))) : 1)) && (((((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23) ? (var_1_19 == ((unsigned long int) ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_6 || (var_1_16 <= (var_1_22 / var_1_24))) ? (var_1_23 == ((signed long int) (((((var_1_8 + (var_1_21 + var_1_24))) < (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((var_1_8 + (var_1_21 + var_1_24))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))))) : 1)) && (var_1_25 == ((signed long int) -256))) && (var_1_26 == ((unsigned short int) var_1_17))) && (var_1_27 == ((unsigned char) var_1_6)) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=2, var_1_1=0, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=2, var_1_24=65540, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=2, var_1_16=-65536, var_1_17=65537, var_1_18=65538, var_1_19=2, var_1_1=0, var_1_20=0, var_1_21=4, var_1_22=1, var_1_23=2, var_1_24=65540, var_1_25=-256, var_1_26=65537, var_1_27=-255, var_1_3=10, var_1_6=-255, var_1_7=0, var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 330 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 958 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 565 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 372 IncrementalHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 393 mSDtfsCounter, 372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 613 GetRequests, 585 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 341 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1175 NumberOfCodeBlocks, 1175 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 2323 SizeOfPredicates, 2 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 8217/8424 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:47:16,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-94.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 1a2614a5d86037480b02d6a9728d38921bae1f55257b3575da577dd0cc2aa974 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:47:18,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:47:18,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:47:18,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:47:18,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:47:18,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:47:18,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:47:18,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:47:18,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:47:18,440 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:47:18,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:47:18,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:47:18,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:47:18,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:47:18,442 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:47:18,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:47:18,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:47:18,445 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:47:18,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:47:18,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:47:18,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:47:18,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:47:18,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:47:18,449 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:47:18,449 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:47:18,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:47:18,449 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:47:18,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:47:18,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:47:18,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:47:18,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:47:18,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:47:18,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:47:18,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:47:18,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:18,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:47:18,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:47:18,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:47:18,451 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:47:18,451 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:47:18,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:47:18,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:47:18,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:47:18,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:47:18,453 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:47:18,454 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 -> 1a2614a5d86037480b02d6a9728d38921bae1f55257b3575da577dd0cc2aa974 [2024-10-13 04:47:18,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:47:18,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:47:18,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:47:18,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:47:18,775 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:47:18,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-94.i [2024-10-13 04:47:20,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:47:20,830 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:47:20,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-94.i [2024-10-13 04:47:20,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df348be6d/69385b9d943947fd84b5078f91d80674/FLAGdafb705ab [2024-10-13 04:47:20,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df348be6d/69385b9d943947fd84b5078f91d80674 [2024-10-13 04:47:20,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:47:20,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:47:20,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:20,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:47:20,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:47:20,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:20" (1/1) ... [2024-10-13 04:47:20,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2ab36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:20, skipping insertion in model container [2024-10-13 04:47:20,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:47:20" (1/1) ... [2024-10-13 04:47:20,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:47:21,124 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_loopvsstraightlinecode_50-while_file-94.i[915,928] [2024-10-13 04:47:21,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:21,217 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:47:21,230 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_loopvsstraightlinecode_50-while_file-94.i[915,928] [2024-10-13 04:47:21,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:47:21,285 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:47:21,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21 WrapperNode [2024-10-13 04:47:21,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:47:21,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:21,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:47:21,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:47:21,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,337 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-13 04:47:21,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:47:21,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:47:21,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:47:21,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:47:21,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,370 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:47:21,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:47:21,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:47:21,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:47:21,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:47:21,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (1/1) ... [2024-10-13 04:47:21,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:47:21,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:47:21,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:47:21,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:47:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:47:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:47:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:47:21,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:47:21,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:47:21,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:47:21,579 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:47:21,582 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:47:24,742 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 04:47:24,743 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:47:24,783 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:47:24,783 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:47:24,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:24 BoogieIcfgContainer [2024-10-13 04:47:24,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:47:24,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:47:24,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:47:24,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:47:24,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:47:20" (1/3) ... [2024-10-13 04:47:24,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9fcd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:47:24, skipping insertion in model container [2024-10-13 04:47:24,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:47:21" (2/3) ... [2024-10-13 04:47:24,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9fcd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:47:24, skipping insertion in model container [2024-10-13 04:47:24,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:47:24" (3/3) ... [2024-10-13 04:47:24,791 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-94.i [2024-10-13 04:47:24,805 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:47:24,806 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:47:24,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:47:24,872 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;@2dcd61e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:47:24,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:47:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 04:47:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 04:47:24,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:24,891 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:24,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:24,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1209995648, now seen corresponding path program 1 times [2024-10-13 04:47:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:47:24,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347747375] [2024-10-13 04:47:24,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:24,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:47:24,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:47:24,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:47:24,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:47:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:25,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:47:25,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:47:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-10-13 04:47:25,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:47:25,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:47:25,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347747375] [2024-10-13 04:47:25,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347747375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:25,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:25,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:47:25,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472565039] [2024-10-13 04:47:25,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:25,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:47:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:47:25,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:47:25,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:47:25,473 INFO L87 Difference]: Start difference. First operand has 65 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 04:47:29,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:47:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:29,128 INFO L93 Difference]: Finished difference Result 127 states and 229 transitions. [2024-10-13 04:47:29,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:47:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 162 [2024-10-13 04:47:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:29,182 INFO L225 Difference]: With dead ends: 127 [2024-10-13 04:47:29,182 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 04:47:29,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:47:29,189 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:29,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 04:47:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 04:47:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 04:47:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 04:47:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-13 04:47:29,242 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 162 [2024-10-13 04:47:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:29,243 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-13 04:47:29,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 04:47:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-13 04:47:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 04:47:29,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:29,249 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:29,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 04:47:29,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:47:29,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:29,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:29,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1174457934, now seen corresponding path program 1 times [2024-10-13 04:47:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:47:29,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651667809] [2024-10-13 04:47:29,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:29,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:47:29,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:47:29,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:47:29,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:47:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:29,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 04:47:29,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:47:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 04:47:30,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:47:30,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:47:30,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651667809] [2024-10-13 04:47:30,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651667809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:47:30,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:47:30,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:47:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663915239] [2024-10-13 04:47:30,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:47:30,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:47:30,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:47:30,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:47:30,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:47:30,823 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 04:47:34,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:47:37,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:47:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:37,431 INFO L93 Difference]: Finished difference Result 193 states and 295 transitions. [2024-10-13 04:47:37,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:47:37,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 162 [2024-10-13 04:47:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:37,477 INFO L225 Difference]: With dead ends: 193 [2024-10-13 04:47:37,477 INFO L226 Difference]: Without dead ends: 131 [2024-10-13 04:47:37,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:47:37,479 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 63 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:37,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 371 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-10-13 04:47:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-13 04:47:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2024-10-13 04:47:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 04:47:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 191 transitions. [2024-10-13 04:47:37,509 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 191 transitions. Word has length 162 [2024-10-13 04:47:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:37,510 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 191 transitions. [2024-10-13 04:47:37,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 04:47:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 191 transitions. [2024-10-13 04:47:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 04:47:37,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:37,513 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:37,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 04:47:37,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:47:37,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:37,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2126088414, now seen corresponding path program 1 times [2024-10-13 04:47:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:47:37,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649108075] [2024-10-13 04:47:37,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:37,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:47:37,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:47:37,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:47:37,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 04:47:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:38,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 04:47:38,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:47:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-13 04:47:38,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:47:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 04:47:39,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:47:39,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649108075] [2024-10-13 04:47:39,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649108075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:47:39,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 04:47:39,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-13 04:47:39,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799501241] [2024-10-13 04:47:39,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 04:47:39,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:47:39,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:47:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:47:39,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:47:39,596 INFO L87 Difference]: Start difference. First operand 123 states and 191 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-13 04:47:42,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:47:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:47:44,457 INFO L93 Difference]: Finished difference Result 519 states and 781 transitions. [2024-10-13 04:47:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 04:47:44,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 163 [2024-10-13 04:47:44,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:47:44,470 INFO L225 Difference]: With dead ends: 519 [2024-10-13 04:47:44,474 INFO L226 Difference]: Without dead ends: 397 [2024-10-13 04:47:44,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2024-10-13 04:47:44,476 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 149 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:47:44,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 270 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 04:47:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-13 04:47:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 202. [2024-10-13 04:47:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 81 states have call successors, (81), 6 states have call predecessors, (81), 6 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-13 04:47:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2024-10-13 04:47:44,535 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 163 [2024-10-13 04:47:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:47:44,536 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2024-10-13 04:47:44,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-13 04:47:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2024-10-13 04:47:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 04:47:44,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:47:44,540 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:47:44,560 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 (4)] Forceful destruction successful, exit code 0 [2024-10-13 04:47:44,744 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 [2024-10-13 04:47:44,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:47:44,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:47:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1733061404, now seen corresponding path program 1 times [2024-10-13 04:47:44,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:47:44,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009358722] [2024-10-13 04:47:44,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:47:44,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:47:44,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:47:44,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:47:44,753 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 (5)] Waiting until timeout for monitored process [2024-10-13 04:47:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:47:47,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 04:47:47,733 INFO L278 TraceCheckSpWp]: Computing forward predicates...