./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_25-while_file-3.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_25-while_file-3.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 a29f19ee668a272ed21698ceeb530ae70127eecfee6eac63ae27dac8400ddad7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:17:16,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:17:16,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:17:16,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:17:16,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:17:16,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:17:16,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:17:16,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:17:16,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:17:16,189 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:17:16,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:17:16,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:17:16,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:17:16,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:17:16,191 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:17:16,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:17:16,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:17:16,191 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:17:16,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:17:16,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:17:16,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:17:16,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:17:16,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:17:16,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:17:16,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:17:16,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:17:16,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:17:16,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:17:16,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:17:16,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:17:16,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:17:16,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:17:16,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:17:16,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:17:16,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:17:16,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:17:16,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:17:16,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:17:16,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:17:16,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:17:16,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:17:16,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:17:16,199 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 -> a29f19ee668a272ed21698ceeb530ae70127eecfee6eac63ae27dac8400ddad7 [2024-10-13 04:17:16,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:17:16,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:17:16,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:17:16,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:17:16,470 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:17:16,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-3.i [2024-10-13 04:17:17,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:17:18,176 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:17:18,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-3.i [2024-10-13 04:17:18,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81e943f49/7e1cfa42f9ff49aa9256e270b05005bc/FLAG5a78d1c3b [2024-10-13 04:17:18,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81e943f49/7e1cfa42f9ff49aa9256e270b05005bc [2024-10-13 04:17:18,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:17:18,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:17:18,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:17:18,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:17:18,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:17:18,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302cfb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18, skipping insertion in model container [2024-10-13 04:17:18,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:17:18,461 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_25-while_file-3.i[914,927] [2024-10-13 04:17:18,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:17:18,540 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:17:18,554 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_25-while_file-3.i[914,927] [2024-10-13 04:17:18,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:17:18,598 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:17:18,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18 WrapperNode [2024-10-13 04:17:18,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:17:18,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:17:18,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:17:18,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:17:18,612 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:17:18" (1/1) ... [2024-10-13 04:17:18,621 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:17:18" (1/1) ... [2024-10-13 04:17:18,656 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-10-13 04:17:18,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:17:18,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:17:18,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:17:18,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:17:18,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,718 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:17:18,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:17:18,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:17:18,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:17:18,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:17:18,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (1/1) ... [2024-10-13 04:17:18,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:17:18,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:17:18,789 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:17:18,792 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:17:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:17:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:17:18,838 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:17:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:17:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:17:18,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:17:18,915 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:17:18,917 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:17:19,142 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 04:17:19,142 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:17:19,196 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:17:19,198 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:17:19,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:17:19 BoogieIcfgContainer [2024-10-13 04:17:19,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:17:19,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:17:19,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:17:19,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:17:19,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:17:18" (1/3) ... [2024-10-13 04:17:19,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49656874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:17:19, skipping insertion in model container [2024-10-13 04:17:19,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:18" (2/3) ... [2024-10-13 04:17:19,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49656874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:17:19, skipping insertion in model container [2024-10-13 04:17:19,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:17:19" (3/3) ... [2024-10-13 04:17:19,210 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-3.i [2024-10-13 04:17:19,223 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:17:19,223 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:17:19,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:17:19,285 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;@685687fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:17:19,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:17:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:17:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 04:17:19,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:17:19,301 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:19,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:17:19,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:17:19,306 INFO L85 PathProgramCache]: Analyzing trace with hash 171684699, now seen corresponding path program 1 times [2024-10-13 04:17:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:17:19,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992996830] [2024-10-13 04:17:19,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:17:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:17:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:17:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:17:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:17:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:17:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:17:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:17:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:17:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:17:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:17:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:17:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:17:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:17:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:17:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:17:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:17:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 04:17:19,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:17:19,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992996830] [2024-10-13 04:17:19,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992996830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:17:19,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:17:19,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:17:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832254852] [2024-10-13 04:17:19,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:17:19,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:17:19,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:17:19,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:17:19,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:17:19,675 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:17:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:17:19,713 INFO L93 Difference]: Finished difference Result 83 states and 143 transitions. [2024-10-13 04:17:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:17:19,716 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2024-10-13 04:17:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:17:19,725 INFO L225 Difference]: With dead ends: 83 [2024-10-13 04:17:19,725 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 04:17:19,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:17:19,732 INFO L432 NwaCegarLoop]: 57 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, 57 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:17:19,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:17:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 04:17:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 04:17:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:17:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-13 04:17:19,818 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 93 [2024-10-13 04:17:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:17:19,819 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-13 04:17:19,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:17:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-13 04:17:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 04:17:19,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:17:19,826 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:19,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:17:19,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:17:19,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:17:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1956768611, now seen corresponding path program 1 times [2024-10-13 04:17:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:17:19,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375407170] [2024-10-13 04:17:19,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:17:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:17:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:17:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:17:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:17:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:17:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:17:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:17:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:17:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:17:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:17:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:17:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:17:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:17:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:17:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:17:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:17:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 04:17:20,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:17:20,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375407170] [2024-10-13 04:17:20,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375407170] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:17:20,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184408683] [2024-10-13 04:17:20,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:17:20,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:17:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:17:20,448 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:17:20,450 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:17:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:20,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 04:17:20,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:17:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 04:17:20,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:17:20,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184408683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:17:20,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:17:20,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-10-13 04:17:20,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085747704] [2024-10-13 04:17:20,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:17:20,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:17:20,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:17:20,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:17:20,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:17:20,763 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:17:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:17:21,189 INFO L93 Difference]: Finished difference Result 114 states and 163 transitions. [2024-10-13 04:17:21,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 04:17:21,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2024-10-13 04:17:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:17:21,192 INFO L225 Difference]: With dead ends: 114 [2024-10-13 04:17:21,192 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 04:17:21,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-13 04:17:21,194 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 74 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:17:21,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 155 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:17:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 04:17:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-10-13 04:17:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 04:17:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 98 transitions. [2024-10-13 04:17:21,224 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 98 transitions. Word has length 93 [2024-10-13 04:17:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:17:21,224 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 98 transitions. [2024-10-13 04:17:21,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:17:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2024-10-13 04:17:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 04:17:21,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:17:21,229 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:21,254 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:17:21,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:17:21,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:17:21,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:17:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1528852059, now seen corresponding path program 1 times [2024-10-13 04:17:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:17:21,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751823043] [2024-10-13 04:17:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:17:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:17:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:17:21,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:17:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:17:21,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:17:21,608 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:17:21,609 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:17:21,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:17:21,613 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 04:17:21,697 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:17:21,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:17:21 BoogieIcfgContainer [2024-10-13 04:17:21,701 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:17:21,702 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:17:21,705 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:17:21,705 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:17:21,706 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:17:19" (3/4) ... [2024-10-13 04:17:21,708 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:17:21,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:17:21,711 INFO L158 Benchmark]: Toolchain (without parser) took 3502.53ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 54.8MB in the beginning and 104.1MB in the end (delta: -49.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-10-13 04:17:21,713 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:17:21,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.40ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 54.8MB in the beginning and 151.5MB in the end (delta: -96.6MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-10-13 04:17:21,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.62ms. Allocated memory is still 182.5MB. Free memory was 151.5MB in the beginning and 149.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:17:21,714 INFO L158 Benchmark]: Boogie Preprocessor took 87.27ms. Allocated memory is still 182.5MB. Free memory was 149.4MB in the beginning and 146.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:17:21,714 INFO L158 Benchmark]: RCFGBuilder took 450.35ms. Allocated memory is still 182.5MB. Free memory was 146.2MB in the beginning and 127.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 04:17:21,715 INFO L158 Benchmark]: TraceAbstraction took 2499.06ms. Allocated memory is still 182.5MB. Free memory was 127.4MB in the beginning and 105.2MB in the end (delta: 22.2MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-10-13 04:17:21,715 INFO L158 Benchmark]: Witness Printer took 7.33ms. Allocated memory is still 182.5MB. Free memory was 105.2MB in the beginning and 104.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:17:21,720 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.16ms. Allocated memory is still 125.8MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.40ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 54.8MB in the beginning and 151.5MB in the end (delta: -96.6MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.62ms. Allocated memory is still 182.5MB. Free memory was 151.5MB in the beginning and 149.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.27ms. Allocated memory is still 182.5MB. Free memory was 149.4MB in the beginning and 146.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.35ms. Allocated memory is still 182.5MB. Free memory was 146.2MB in the beginning and 127.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2499.06ms. Allocated memory is still 182.5MB. Free memory was 127.4MB in the beginning and 105.2MB in the end (delta: 22.2MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 7.33ms. Allocated memory is still 182.5MB. Free memory was 105.2MB in the beginning and 104.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 127.5; [L32] double var_1_13 = 7.25; [L33] unsigned char var_1_14 = 1; [L34] unsigned char var_1_15 = 0; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L64] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L64] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L65] var_1_5 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L66] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L67] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L67] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L68] var_1_7 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L69] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L70] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L70] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L71] var_1_8 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L72] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L73] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L73] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L74] var_1_9 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L75] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L77] var_1_10 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L78] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L80] var_1_13 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L81] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L82] var_1_15 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L83] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L84] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L97] RET updateVariables() [L98] CALL step() [L38] var_1_12 = var_1_13 [L39] var_1_14 = var_1_15 VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=536870916, var_1_13=536870916, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L40] COND FALSE !(! var_1_14) [L43] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=536870916, var_1_13=536870916, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-536870912, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L45] signed long int stepLocal_2 = var_1_7; [L46] signed long int stepLocal_1 = var_1_9; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-1073741823, var_1_10=536870911, var_1_11=1, var_1_12=536870916, var_1_13=536870916, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-536870912, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L47] COND FALSE !(var_1_8 <= stepLocal_2) VAL [isInitial=1, stepLocal_1=0, var_1_10=536870911, var_1_11=1, var_1_12=536870916, var_1_13=536870916, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-536870912, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L54] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=0, var_1_10=536870911, var_1_11=1, var_1_12=536870916, var_1_13=536870916, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-536870912, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L55] COND FALSE !(! var_1_11) VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=0, var_1_10=536870911, var_1_11=1, var_1_12=536870916, var_1_13=536870916, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-536870912, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L98] RET step() [L99] CALL, EXPR property() [L89-L90] return (((((! var_1_11) ? ((var_1_11 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_14) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_14 || (! var_1_5))))) : 1)) && (var_1_12 == ((double) var_1_13))) && (var_1_14 == ((unsigned char) var_1_15)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=536870916, var_1_13=536870916, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-536870912, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=536870916, var_1_13=536870916, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-536870912, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 115 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 358 SizeOfPredicates, 1 NumberOfNonLiveVariables, 219 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1257/1260 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:17:21,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-3.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 a29f19ee668a272ed21698ceeb530ae70127eecfee6eac63ae27dac8400ddad7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:17:24,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:17:24,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:17:24,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:17:24,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:17:24,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:17:24,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:17:24,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:17:24,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:17:24,188 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:17:24,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:17:24,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:17:24,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:17:24,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:17:24,192 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:17:24,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:17:24,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:17:24,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:17:24,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:17:24,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:17:24,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:17:24,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:17:24,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:17:24,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:17:24,195 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:17:24,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:17:24,196 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:17:24,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:17:24,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:17:24,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:17:24,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:17:24,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:17:24,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:17:24,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:17:24,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:17:24,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:17:24,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:17:24,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:17:24,200 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:17:24,200 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:17:24,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:17:24,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:17:24,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:17:24,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:17:24,202 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:17:24,202 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 -> a29f19ee668a272ed21698ceeb530ae70127eecfee6eac63ae27dac8400ddad7 [2024-10-13 04:17:24,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:17:24,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:17:24,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:17:24,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:17:24,591 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:17:24,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-3.i [2024-10-13 04:17:26,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:17:26,533 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:17:26,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-3.i [2024-10-13 04:17:26,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6026cd20e/4cfdb84949a94806b31d2ecb9c5b38cc/FLAG7399b01b3 [2024-10-13 04:17:26,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6026cd20e/4cfdb84949a94806b31d2ecb9c5b38cc [2024-10-13 04:17:26,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:17:26,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:17:26,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:17:26,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:17:26,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:17:26,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:26,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3204a720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26, skipping insertion in model container [2024-10-13 04:17:26,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:26,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:17:26,816 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_25-while_file-3.i[914,927] [2024-10-13 04:17:26,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:17:26,891 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:17:26,906 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_25-while_file-3.i[914,927] [2024-10-13 04:17:26,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:17:26,951 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:17:26,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26 WrapperNode [2024-10-13 04:17:26,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:17:26,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:17:26,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:17:26,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:17:26,960 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:17:26" (1/1) ... [2024-10-13 04:17:26,978 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:17:26" (1/1) ... [2024-10-13 04:17:27,013 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-10-13 04:17:27,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:17:27,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:17:27,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:17:27,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:17:27,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:27,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:27,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:27,053 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:17:27,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:27,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:27,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:27,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:27,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:27,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:27,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:17:27,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:17:27,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:17:27,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:17:27,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (1/1) ... [2024-10-13 04:17:27,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:17:27,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:17:27,130 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:17:27,134 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:17:27,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:17:27,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:17:27,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:17:27,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:17:27,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:17:27,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:17:27,300 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:17:27,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:17:27,541 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 04:17:27,542 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:17:27,617 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:17:27,617 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:17:27,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:17:27 BoogieIcfgContainer [2024-10-13 04:17:27,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:17:27,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:17:27,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:17:27,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:17:27,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:17:26" (1/3) ... [2024-10-13 04:17:27,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6ca100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:17:27, skipping insertion in model container [2024-10-13 04:17:27,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:17:26" (2/3) ... [2024-10-13 04:17:27,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6ca100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:17:27, skipping insertion in model container [2024-10-13 04:17:27,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:17:27" (3/3) ... [2024-10-13 04:17:27,629 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-3.i [2024-10-13 04:17:27,646 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:17:27,646 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:17:27,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:17:27,718 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;@738856ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:17:27,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:17:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:17:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 04:17:27,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:17:27,734 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:27,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:17:27,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:17:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash 171684699, now seen corresponding path program 1 times [2024-10-13 04:17:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:17:27,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068158406] [2024-10-13 04:17:27,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:17:27,759 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:17:27,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:17:27,776 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:17:27,778 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:17:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:27,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:17:27,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:17:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-13 04:17:28,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:17:28,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:17:28,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068158406] [2024-10-13 04:17:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068158406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:17:28,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:17:28,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:17:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501076403] [2024-10-13 04:17:28,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:17:28,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:17:28,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:17:28,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:17:28,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:17:28,050 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:17:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:17:28,099 INFO L93 Difference]: Finished difference Result 83 states and 143 transitions. [2024-10-13 04:17:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:17:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2024-10-13 04:17:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:17:28,111 INFO L225 Difference]: With dead ends: 83 [2024-10-13 04:17:28,112 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 04:17:28,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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:17:28,120 INFO L432 NwaCegarLoop]: 57 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, 57 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:17:28,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:17:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 04:17:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 04:17:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 04:17:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-13 04:17:28,174 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 93 [2024-10-13 04:17:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:17:28,174 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-13 04:17:28,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:17:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-13 04:17:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 04:17:28,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:17:28,183 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:28,192 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 (2)] Forceful destruction successful, exit code 0 [2024-10-13 04:17:28,383 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:17:28,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:17:28,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:17:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1956768611, now seen corresponding path program 1 times [2024-10-13 04:17:28,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:17:28,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818726622] [2024-10-13 04:17:28,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:17:28,389 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:17:28,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:17:28,393 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:17:28,395 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:17:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:28,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:17:28,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:17:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 04:17:28,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:17:28,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:17:28,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818726622] [2024-10-13 04:17:28,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818726622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:17:28,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:17:28,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 04:17:28,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157224909] [2024-10-13 04:17:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:17:28,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:17:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:17:28,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:17:28,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:17:28,805 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:17:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:17:29,520 INFO L93 Difference]: Finished difference Result 114 states and 163 transitions. [2024-10-13 04:17:29,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 04:17:29,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2024-10-13 04:17:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:17:29,524 INFO L225 Difference]: With dead ends: 114 [2024-10-13 04:17:29,526 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 04:17:29,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-10-13 04:17:29,529 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 74 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:17:29,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 156 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:17:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 04:17:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-10-13 04:17:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 04:17:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 98 transitions. [2024-10-13 04:17:29,561 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 98 transitions. Word has length 93 [2024-10-13 04:17:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:17:29,563 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 98 transitions. [2024-10-13 04:17:29,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 04:17:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2024-10-13 04:17:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 04:17:29,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:17:29,565 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:29,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 04:17:29,766 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:17:29,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:17:29,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:17:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1528852059, now seen corresponding path program 1 times [2024-10-13 04:17:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:17:29,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341879990] [2024-10-13 04:17:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:17:29,770 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:17:29,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:17:29,773 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:17:29,775 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:17:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:17:29,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 04:17:30,005 INFO L278 TraceCheckSpWp]: Computing forward predicates...