./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-1loop_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.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 ce316eeb4b3641499c2394eeff325d13cd059837344f9d1e23ab187d3034f448 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:24:27,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:24:27,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:24:27,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:24:27,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:24:27,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:24:27,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:24:27,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:24:27,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:24:27,353 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:24:27,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:24:27,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:24:27,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:24:27,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:24:27,356 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:24:27,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:24:27,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:24:27,357 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:24:27,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:24:27,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:24:27,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:24:27,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:24:27,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:24:27,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:24:27,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:24:27,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:24:27,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:24:27,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:24:27,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:24:27,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:24:27,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:24:27,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:24:27,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:24:27,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:24:27,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:24:27,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:24:27,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:24:27,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:24:27,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:24:27,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:24:27,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:24:27,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:24:27,364 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 -> ce316eeb4b3641499c2394eeff325d13cd059837344f9d1e23ab187d3034f448 [2024-10-24 09:24:27,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:24:27,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:24:27,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:24:27,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:24:27,583 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:24:27,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-10-24 09:24:28,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:24:29,107 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:24:29,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-10-24 09:24:29,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9398a0bb6/2b00cfb2796740938db280b42161d464/FLAGedf8a0c40 [2024-10-24 09:24:29,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9398a0bb6/2b00cfb2796740938db280b42161d464 [2024-10-24 09:24:29,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:24:29,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:24:29,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:24:29,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:24:29,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:24:29,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2132628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29, skipping insertion in model container [2024-10-24 09:24:29,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:24:29,314 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-1loop_file-19.i[915,928] [2024-10-24 09:24:29,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:24:29,373 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:24:29,384 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-1loop_file-19.i[915,928] [2024-10-24 09:24:29,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:24:29,428 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:24:29,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29 WrapperNode [2024-10-24 09:24:29,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:24:29,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:24:29,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:24:29,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:24:29,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,477 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-10-24 09:24:29,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:24:29,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:24:29,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:24:29,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:24:29,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,512 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:24:29,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:24:29,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:24:29,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:24:29,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:24:29,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (1/1) ... [2024-10-24 09:24:29,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:24:29,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:24:29,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:24:29,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:24:29,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:24:29,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:24:29,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:24:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:24:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:24:29,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:24:29,677 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:24:29,679 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:24:29,925 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 09:24:29,926 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:24:29,996 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:24:29,996 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:24:29,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:24:29 BoogieIcfgContainer [2024-10-24 09:24:29,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:24:29,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:24:29,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:24:30,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:24:30,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:24:29" (1/3) ... [2024-10-24 09:24:30,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba214e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:24:30, skipping insertion in model container [2024-10-24 09:24:30,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:29" (2/3) ... [2024-10-24 09:24:30,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba214e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:24:30, skipping insertion in model container [2024-10-24 09:24:30,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:24:29" (3/3) ... [2024-10-24 09:24:30,003 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-10-24 09:24:30,016 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:24:30,016 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:24:30,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:24:30,080 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;@509f4a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:24:30,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:24:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:24:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 09:24:30,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:24:30,096 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:24:30,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:24:30,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:24:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash 551383544, now seen corresponding path program 1 times [2024-10-24 09:24:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:24:30,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938601257] [2024-10-24 09:24:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:24:30,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:24:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:24:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:24:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:24:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:24:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:24:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:24:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:24:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:24:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:24:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:24:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:24:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:24:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:24:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:24:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:24:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:24:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:24:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:24:30,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:24:30,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938601257] [2024-10-24 09:24:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938601257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:24:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:24:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:24:30,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196629019] [2024-10-24 09:24:30,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:24:30,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:24:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:24:30,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:24:30,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:24:30,464 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:24:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:24:30,503 INFO L93 Difference]: Finished difference Result 105 states and 176 transitions. [2024-10-24 09:24:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:24:30,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2024-10-24 09:24:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:24:30,516 INFO L225 Difference]: With dead ends: 105 [2024-10-24 09:24:30,516 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 09:24:30,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-24 09:24:30,523 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:24:30,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:24:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 09:24:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-24 09:24:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:24:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-10-24 09:24:30,570 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 109 [2024-10-24 09:24:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:24:30,570 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-10-24 09:24:30,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:24:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-10-24 09:24:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 09:24:30,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:24:30,573 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:24:30,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:24:30,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:24:30,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:24:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1784131470, now seen corresponding path program 1 times [2024-10-24 09:24:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:24:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095286604] [2024-10-24 09:24:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:24:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:24:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:24:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:24:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:24:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:24:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:24:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:24:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:24:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:24:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:24:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:24:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:24:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:24:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:24:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:24:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:24:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:24:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:24:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:24:30,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:24:30,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095286604] [2024-10-24 09:24:30,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095286604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:24:30,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:24:30,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:24:30,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927090267] [2024-10-24 09:24:30,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:24:30,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:24:30,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:24:30,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:24:30,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:24:30,810 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:24:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:24:30,846 INFO L93 Difference]: Finished difference Result 139 states and 203 transitions. [2024-10-24 09:24:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:24:30,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-10-24 09:24:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:24:30,848 INFO L225 Difference]: With dead ends: 139 [2024-10-24 09:24:30,849 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 09:24:30,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:24:30,850 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:24:30,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 132 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:24:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 09:24:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-10-24 09:24:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 55 states have internal predecessors, (67), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 09:24:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2024-10-24 09:24:30,863 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 109 [2024-10-24 09:24:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:24:30,864 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2024-10-24 09:24:30,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:24:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2024-10-24 09:24:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 09:24:30,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:24:30,866 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:24:30,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:24:30,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:24:30,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:24:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1830777456, now seen corresponding path program 1 times [2024-10-24 09:24:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:24:30,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797292872] [2024-10-24 09:24:30,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:24:30,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:24:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:24:31,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:24:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:24:31,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:24:31,134 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:24:31,135 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:24:31,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:24:31,140 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 09:24:31,212 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:24:31,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:24:31 BoogieIcfgContainer [2024-10-24 09:24:31,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:24:31,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:24:31,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:24:31,218 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:24:31,218 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:24:29" (3/4) ... [2024-10-24 09:24:31,220 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:24:31,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:24:31,223 INFO L158 Benchmark]: Toolchain (without parser) took 2088.27ms. Allocated memory is still 205.5MB. Free memory was 135.6MB in the beginning and 149.3MB in the end (delta: -13.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:24:31,223 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:24:31,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.44ms. Allocated memory is still 205.5MB. Free memory was 135.6MB in the beginning and 121.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:24:31,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.76ms. Allocated memory is still 205.5MB. Free memory was 121.3MB in the beginning and 118.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:24:31,225 INFO L158 Benchmark]: Boogie Preprocessor took 53.79ms. Allocated memory is still 205.5MB. Free memory was 118.9MB in the beginning and 116.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:24:31,225 INFO L158 Benchmark]: RCFGBuilder took 464.37ms. Allocated memory is still 205.5MB. Free memory was 116.0MB in the beginning and 169.9MB in the end (delta: -53.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 09:24:31,225 INFO L158 Benchmark]: TraceAbstraction took 1218.65ms. Allocated memory is still 205.5MB. Free memory was 169.0MB in the beginning and 149.3MB in the end (delta: 19.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-10-24 09:24:31,227 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 205.5MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:24:31,229 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.13ms. Allocated memory is still 125.8MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.44ms. Allocated memory is still 205.5MB. Free memory was 135.6MB in the beginning and 121.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.76ms. Allocated memory is still 205.5MB. Free memory was 121.3MB in the beginning and 118.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.79ms. Allocated memory is still 205.5MB. Free memory was 118.9MB in the beginning and 116.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 464.37ms. Allocated memory is still 205.5MB. Free memory was 116.0MB in the beginning and 169.9MB in the end (delta: -53.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1218.65ms. Allocated memory is still 205.5MB. Free memory was 169.0MB in the beginning and 149.3MB in the end (delta: 19.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 205.5MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of shiftLeft at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 8; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] unsigned long int var_1_4 = 1; [L26] unsigned long int var_1_5 = 5; [L27] signed char var_1_7 = 4; [L28] signed char var_1_8 = 100; [L29] unsigned char var_1_9 = 1; [L30] signed long int var_1_10 = -8; [L31] float var_1_11 = 255.2; [L32] float var_1_12 = 128.25; [L33] float var_1_13 = 100.5; [L34] float var_1_14 = 255.9; [L35] signed long int var_1_15 = -128; [L36] unsigned short int var_1_16 = 2; [L37] signed long int last_1_var_1_10 = -8; [L101] isInitial = 1 [L102] FCALL initially() [L103] int k_loop; [L104] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=128, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L104] COND TRUE k_loop < 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_10 = var_1_10 [L105] RET updateLastVariables() [L106] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L66] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L67] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L68] var_1_3 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L70] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L71] var_1_4 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_4 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L73] RET assume_abort_if_not(var_1_4 <= 12) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_7=4, var_1_8=100, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_7=4, var_1_8=100, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 11) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=4, var_1_8=100, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 11) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=4, var_1_8=100, var_1_9=1] [L77] var_1_7 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=100, var_1_9=1] [L78] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=100, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=100, var_1_9=1] [L79] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=100, var_1_9=1] [L80] var_1_8 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L82] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L83] var_1_9 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0] [L84] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L86] var_1_12 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L88] var_1_13 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L90] var_1_14 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L106] RET updateVariables() [L107] CALL step() [L41] COND FALSE !(var_1_7 < var_1_3) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L46] COND TRUE \read(var_1_9) [L47] var_1_10 = var_1_5 VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L50] var_1_11 = (var_1_12 + (var_1_13 + var_1_14)) [L51] var_1_16 = 64 VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=-128, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L52] COND TRUE \read(var_1_9) [L53] var_1_15 = (var_1_7 + var_1_16) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L55] signed long int stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_10=-8, stepLocal_0=127, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L56] EXPR (var_1_2 - var_1_3) << (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_10=-8, stepLocal_0=127, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L56] COND TRUE ((var_1_2 - var_1_3) << (var_1_4 + var_1_5)) <= stepLocal_0 [L57] var_1_1 = ((((var_1_4) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_4) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L107] RET step() [L108] CALL, EXPR property() [L97] EXPR (var_1_2 - var_1_3) << (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L97-L98] return (((((((var_1_2 - var_1_3) << (var_1_4 + var_1_5)) <= var_1_15) ? (var_1_1 == ((signed char) ((((var_1_4) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_4) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))))) : (var_1_9 ? (var_1_1 == ((signed char) var_1_5)) : 1)) && ((var_1_7 < var_1_3) ? ((last_1_var_1_10 > var_1_7) ? (var_1_10 == ((signed long int) (var_1_3 - var_1_8))) : 1) : (var_1_9 ? (var_1_10 == ((signed long int) var_1_5)) : 1))) && (var_1_11 == ((float) (var_1_12 + (var_1_13 + var_1_14))))) && (var_1_9 ? (var_1_15 == ((signed long int) (var_1_7 + var_1_16))) : 1)) && (var_1_16 == ((unsigned short int) 64)) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=-4294967296, var_1_7=63, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 141 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:24:31,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.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 ce316eeb4b3641499c2394eeff325d13cd059837344f9d1e23ab187d3034f448 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:24:33,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:24:33,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:24:33,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:24:33,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:24:33,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:24:33,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:24:33,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:24:33,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:24:33,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:24:33,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:24:33,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:24:33,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:24:33,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:24:33,291 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:24:33,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:24:33,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:24:33,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:24:33,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:24:33,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:24:33,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:24:33,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:24:33,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:24:33,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:24:33,294 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:24:33,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:24:33,295 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:24:33,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:24:33,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:24:33,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:24:33,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:24:33,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:24:33,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:24:33,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:24:33,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:24:33,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:24:33,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:24:33,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:24:33,298 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:24:33,298 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:24:33,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:24:33,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:24:33,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:24:33,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:24:33,300 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:24:33,300 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 -> ce316eeb4b3641499c2394eeff325d13cd059837344f9d1e23ab187d3034f448 [2024-10-24 09:24:33,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:24:33,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:24:33,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:24:33,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:24:33,584 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:24:33,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-10-24 09:24:34,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:24:35,165 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:24:35,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-10-24 09:24:35,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11695c7a/b991a30ff59048d2a1e0b7100cad4db4/FLAG7ff06140b [2024-10-24 09:24:35,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11695c7a/b991a30ff59048d2a1e0b7100cad4db4 [2024-10-24 09:24:35,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:24:35,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:24:35,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:24:35,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:24:35,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:24:35,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b58b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35, skipping insertion in model container [2024-10-24 09:24:35,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:24:35,747 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-1loop_file-19.i[915,928] [2024-10-24 09:24:35,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:24:35,812 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:24:35,822 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-1loop_file-19.i[915,928] [2024-10-24 09:24:35,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:24:35,849 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:24:35,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35 WrapperNode [2024-10-24 09:24:35,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:24:35,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:24:35,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:24:35,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:24:35,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,894 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-24 09:24:35,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:24:35,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:24:35,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:24:35,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:24:35,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,928 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:24:35,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:24:35,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:24:35,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:24:35,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:24:35,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (1/1) ... [2024-10-24 09:24:35,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:24:35,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:24:35,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:24:36,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:24:36,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:24:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:24:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:24:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:24:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:24:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:24:36,138 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:24:36,140 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:24:36,682 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 09:24:36,686 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:24:36,739 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:24:36,739 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:24:36,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:24:36 BoogieIcfgContainer [2024-10-24 09:24:36,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:24:36,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:24:36,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:24:36,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:24:36,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:24:35" (1/3) ... [2024-10-24 09:24:36,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a69aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:24:36, skipping insertion in model container [2024-10-24 09:24:36,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:24:35" (2/3) ... [2024-10-24 09:24:36,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a69aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:24:36, skipping insertion in model container [2024-10-24 09:24:36,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:24:36" (3/3) ... [2024-10-24 09:24:36,749 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-10-24 09:24:36,761 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:24:36,761 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:24:36,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:24:36,826 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;@7781973d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:24:36,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:24:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:24:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 09:24:36,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:24:36,839 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:24:36,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:24:36,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:24:36,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1719004040, now seen corresponding path program 1 times [2024-10-24 09:24:36,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:24:36,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959225933] [2024-10-24 09:24:36,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:24:36,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:24:36,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:24:36,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:24:36,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:24:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:37,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:24:37,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:24:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-24 09:24:37,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:24:37,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:24:37,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959225933] [2024-10-24 09:24:37,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959225933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:24:37,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:24:37,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:24:37,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547428567] [2024-10-24 09:24:37,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:24:37,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:24:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:24:37,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:24:37,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:24:37,132 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:24:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:24:37,317 INFO L93 Difference]: Finished difference Result 95 states and 162 transitions. [2024-10-24 09:24:37,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:24:37,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2024-10-24 09:24:37,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:24:37,328 INFO L225 Difference]: With dead ends: 95 [2024-10-24 09:24:37,328 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 09:24:37,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-24 09:24:37,336 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:24:37,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:24:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 09:24:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 09:24:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:24:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-24 09:24:37,375 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 106 [2024-10-24 09:24:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:24:37,376 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-24 09:24:37,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:24:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-24 09:24:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 09:24:37,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:24:37,378 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:24:37,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:24:37,578 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-24 09:24:37,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:24:37,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:24:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 838479694, now seen corresponding path program 1 times [2024-10-24 09:24:37,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:24:37,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396198427] [2024-10-24 09:24:37,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:24:37,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:24:37,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:24:37,586 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-24 09:24:37,587 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-24 09:24:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:37,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 09:24:37,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:24:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:24:37,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:24:37,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:24:37,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396198427] [2024-10-24 09:24:37,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396198427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:24:37,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:24:37,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:24:37,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180094199] [2024-10-24 09:24:37,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:24:37,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:24:37,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:24:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:24:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:24:37,767 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:24:38,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:24:38,137 INFO L93 Difference]: Finished difference Result 124 states and 182 transitions. [2024-10-24 09:24:38,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:24:38,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2024-10-24 09:24:38,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:24:38,139 INFO L225 Difference]: With dead ends: 124 [2024-10-24 09:24:38,140 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 09:24:38,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:24:38,141 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:24:38,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 117 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:24:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 09:24:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-10-24 09:24:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 09:24:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2024-10-24 09:24:38,156 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 106 [2024-10-24 09:24:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:24:38,156 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2024-10-24 09:24:38,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:24:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2024-10-24 09:24:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 09:24:38,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:24:38,158 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:24:38,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 09:24:38,358 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-24 09:24:38,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:24:38,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:24:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash 781221392, now seen corresponding path program 1 times [2024-10-24 09:24:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:24:38,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237476774] [2024-10-24 09:24:38,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:24:38,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:24:38,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:24:38,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:24:38,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:24:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:24:38,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 09:24:38,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:25:09,681 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-24 09:25:24,708 WARN L286 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-24 09:25:46,753 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)