./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-08 23:39:05,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:39:05,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:39:05,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:39:05,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:39:05,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:39:05,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:39:05,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:39:05,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:39:05,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:39:05,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:39:05,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:39:05,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:39:05,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:39:05,125 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:39:05,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:39:05,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:39:05,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:39:05,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:39:05,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:39:05,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:39:05,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:39:05,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:39:05,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:39:05,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:39:05,128 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:39:05,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:39:05,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:39:05,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:39:05,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:39:05,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:39:05,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:39:05,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:39:05,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:39:05,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:39:05,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:39:05,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:39:05,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:39:05,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:39:05,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:39:05,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:39:05,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:39:05,135 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-11-08 23:39:05,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:39:05,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:39:05,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:39:05,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:39:05,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:39:05,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-11-08 23:39:06,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:39:06,871 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:39:06,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-11-08 23:39:06,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9b0aaaf/272072013f92428a8d78eb0f189f164c/FLAGd4e9d8b66 [2024-11-08 23:39:06,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9b0aaaf/272072013f92428a8d78eb0f189f164c [2024-11-08 23:39:06,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:39:06,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:39:06,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:39:06,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:39:06,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:39:06,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:39:06" (1/1) ... [2024-11-08 23:39:06,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18dec1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:06, skipping insertion in model container [2024-11-08 23:39:06,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:39:06" (1/1) ... [2024-11-08 23:39:06,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:39:07,210 WARN L250 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-11-08 23:39:07,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:39:07,266 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:39:07,275 WARN L250 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-11-08 23:39:07,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:39:07,318 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:39:07,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07 WrapperNode [2024-11-08 23:39:07,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:39:07,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:39:07,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:39:07,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:39:07,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,363 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-08 23:39:07,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:39:07,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:39:07,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:39:07,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:39:07,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,392 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-11-08 23:39:07,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:39:07,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:39:07,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:39:07,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:39:07,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (1/1) ... [2024-11-08 23:39:07,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:39:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:39:07,459 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-11-08 23:39:07,469 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-11-08 23:39:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:39:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:39:07,504 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:39:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:39:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:39:07,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:39:07,566 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:39:07,568 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:39:07,756 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 23:39:07,756 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:39:07,769 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:39:07,769 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:39:07,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:07 BoogieIcfgContainer [2024-11-08 23:39:07,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:39:07,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:39:07,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:39:07,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:39:07,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:39:06" (1/3) ... [2024-11-08 23:39:07,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a681de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:39:07, skipping insertion in model container [2024-11-08 23:39:07,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:07" (2/3) ... [2024-11-08 23:39:07,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a681de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:39:07, skipping insertion in model container [2024-11-08 23:39:07,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:07" (3/3) ... [2024-11-08 23:39:07,776 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-11-08 23:39:07,787 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:39:07,788 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:39:07,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:39:07,832 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;@4c041d9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:39:07,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:39:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 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-11-08 23:39:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:39:07,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:07,844 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, 1, 1, 1, 1] [2024-11-08 23:39:07,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:07,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2116476602, now seen corresponding path program 1 times [2024-11-08 23:39:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:39:07,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832652305] [2024-11-08 23:39:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:07,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:39:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:39:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:39:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:39:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:39:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:39:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:39:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:39:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:39:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:39:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:39:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:39:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:39:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:39:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:39:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:39:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:39:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:39:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:39:08,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:39:08,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832652305] [2024-11-08 23:39:08,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832652305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:39:08,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:39:08,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:39:08,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828502739] [2024-11-08 23:39:08,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:39:08,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:39:08,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:39:08,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:39:08,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:39:08,169 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-11-08 23:39:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:39:08,191 INFO L93 Difference]: Finished difference Result 117 states and 188 transitions. [2024-11-08 23:39:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:39:08,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 113 [2024-11-08 23:39:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:39:08,200 INFO L225 Difference]: With dead ends: 117 [2024-11-08 23:39:08,200 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 23:39:08,204 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-11-08 23:39:08,207 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:39:08,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:39:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 23:39:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-08 23:39:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 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-11-08 23:39:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-11-08 23:39:08,242 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 113 [2024-11-08 23:39:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:39:08,242 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-11-08 23:39:08,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-11-08 23:39:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-11-08 23:39:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:39:08,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:08,249 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, 1, 1, 1, 1] [2024-11-08 23:39:08,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:39:08,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:08,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1565012096, now seen corresponding path program 1 times [2024-11-08 23:39:08,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:39:08,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416447381] [2024-11-08 23:39:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:08,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:39:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:39:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:39:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:39:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:39:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:39:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:39:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:39:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:39:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:39:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:39:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:39:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:39:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:39:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:39:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:39:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:39:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:39:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:39:08,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:39:08,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416447381] [2024-11-08 23:39:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416447381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:39:08,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:39:08,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:39:08,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846398483] [2024-11-08 23:39:08,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:39:08,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:39:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:39:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:39:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:39:08,514 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-11-08 23:39:08,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:39:08,562 INFO L93 Difference]: Finished difference Result 150 states and 214 transitions. [2024-11-08 23:39:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:39:08,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 113 [2024-11-08 23:39:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:39:08,564 INFO L225 Difference]: With dead ends: 150 [2024-11-08 23:39:08,565 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 23:39:08,566 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-11-08 23:39:08,567 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:39:08,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 145 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:39:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 23:39:08,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-11-08 23:39:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 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-11-08 23:39:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2024-11-08 23:39:08,622 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 113 [2024-11-08 23:39:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:39:08,625 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2024-11-08 23:39:08,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-11-08 23:39:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2024-11-08 23:39:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:39:08,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:08,626 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, 1, 1, 1, 1] [2024-11-08 23:39:08,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:39:08,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:08,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1171985086, now seen corresponding path program 1 times [2024-11-08 23:39:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:39:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131487053] [2024-11-08 23:39:08,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:39:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:39:08,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:39:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:39:08,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:39:08,838 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:39:08,840 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:39:08,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:39:08,843 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:39:08,926 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:39:08,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:39:08 BoogieIcfgContainer [2024-11-08 23:39:08,932 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:39:08,933 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:39:08,933 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:39:08,933 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:39:08,934 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:07" (3/4) ... [2024-11-08 23:39:08,936 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:39:08,936 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:39:08,939 INFO L158 Benchmark]: Toolchain (without parser) took 2027.86ms. Allocated memory is still 178.3MB. Free memory was 109.5MB in the beginning and 113.8MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:39:08,939 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory was 137.7MB in the beginning and 137.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:39:08,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.77ms. Allocated memory is still 178.3MB. Free memory was 109.3MB in the beginning and 145.0MB in the end (delta: -35.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-08 23:39:08,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.47ms. Allocated memory is still 178.3MB. Free memory was 145.0MB in the beginning and 143.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:39:08,940 INFO L158 Benchmark]: Boogie Preprocessor took 49.90ms. Allocated memory is still 178.3MB. Free memory was 142.1MB in the beginning and 140.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:39:08,943 INFO L158 Benchmark]: RCFGBuilder took 355.45ms. Allocated memory is still 178.3MB. Free memory was 140.0MB in the beginning and 122.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:39:08,943 INFO L158 Benchmark]: TraceAbstraction took 1161.02ms. Allocated memory is still 178.3MB. Free memory was 121.1MB in the beginning and 113.8MB in the end (delta: 7.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-08 23:39:08,943 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 178.3MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:39:08,944 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory was 137.7MB in the beginning and 137.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.77ms. Allocated memory is still 178.3MB. Free memory was 109.3MB in the beginning and 145.0MB in the end (delta: -35.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.47ms. Allocated memory is still 178.3MB. Free memory was 145.0MB in the beginning and 143.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.90ms. Allocated memory is still 178.3MB. Free memory was 142.1MB in the beginning and 140.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 355.45ms. Allocated memory is still 178.3MB. Free memory was 140.0MB in the beginning and 122.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1161.02ms. Allocated memory is still 178.3MB. Free memory was 121.1MB in the beginning and 113.8MB in the end (delta: 7.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 178.3MB. Free memory is still 113.8MB. 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 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; VAL [isInitial=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] [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 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=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] [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=4294967296, 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=4294967296, 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=4294967296, 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=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=4294967296, 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=4294967296, 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=4294967296, var_1_5=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=4294967296, var_1_5=0, 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=4294967296, var_1_5=0, 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=4294967296, var_1_5=0, 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=4294967296, var_1_5=0, 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=4294967296, var_1_5=0, 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=4294967296, var_1_5=0, 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=4294967296, var_1_5=0, 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=4294967296, var_1_5=0, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126] [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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126] [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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126] [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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=126, var_1_2=127, var_1_3=63, var_1_4=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=126, var_1_2=127, var_1_3=63, var_1_4=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=126, var_1_2=127, var_1_3=63, var_1_4=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, 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=126, var_1_2=127, var_1_3=63, var_1_4=4294967296, var_1_5=0, var_1_7=63, var_1_8=126, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 161 mSDtfsCounter, 9 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=94occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 234 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-11-08 23:39:08,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-08 23:39:11,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:39:11,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:39:11,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:39:11,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:39:11,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:39:11,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:39:11,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:39:11,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:39:11,206 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:39:11,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:39:11,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:39:11,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:39:11,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:39:11,208 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:39:11,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:39:11,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:39:11,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:39:11,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:39:11,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:39:11,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:39:11,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:39:11,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:39:11,214 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:39:11,214 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:39:11,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:39:11,215 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:39:11,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:39:11,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:39:11,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:39:11,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:39:11,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:39:11,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:39:11,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:39:11,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:39:11,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:39:11,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:39:11,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:39:11,217 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:39:11,217 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:39:11,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:39:11,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:39:11,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:39:11,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:39:11,220 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-11-08 23:39:11,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:39:11,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:39:11,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:39:11,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:39:11,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:39:11,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-11-08 23:39:12,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:39:13,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:39:13,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-11-08 23:39:13,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e395b4f8/b48c0059aaea4ec8bd7061eec04205d9/FLAG646d1352d [2024-11-08 23:39:13,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e395b4f8/b48c0059aaea4ec8bd7061eec04205d9 [2024-11-08 23:39:13,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:39:13,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:39:13,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:39:13,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:39:13,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:39:13,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@627a799a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13, skipping insertion in model container [2024-11-08 23:39:13,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:39:13,213 WARN L250 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-11-08 23:39:13,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:39:13,269 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:39:13,278 WARN L250 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-11-08 23:39:13,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:39:13,324 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:39:13,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13 WrapperNode [2024-11-08 23:39:13,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:39:13,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:39:13,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:39:13,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:39:13,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,362 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-08 23:39:13,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:39:13,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:39:13,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:39:13,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:39:13,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,394 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-11-08 23:39:13,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:39:13,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:39:13,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:39:13,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:39:13,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (1/1) ... [2024-11-08 23:39:13,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:39:13,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:39:13,449 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-11-08 23:39:13,459 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-11-08 23:39:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:39:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:39:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:39:13,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:39:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:39:13,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:39:13,568 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:39:13,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:39:14,089 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 23:39:14,090 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:39:14,102 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:39:14,103 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:39:14,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:14 BoogieIcfgContainer [2024-11-08 23:39:14,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:39:14,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:39:14,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:39:14,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:39:14,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:39:13" (1/3) ... [2024-11-08 23:39:14,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b15c9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:39:14, skipping insertion in model container [2024-11-08 23:39:14,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:39:13" (2/3) ... [2024-11-08 23:39:14,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b15c9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:39:14, skipping insertion in model container [2024-11-08 23:39:14,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:14" (3/3) ... [2024-11-08 23:39:14,113 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-19.i [2024-11-08 23:39:14,124 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:39:14,124 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:39:14,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:39:14,166 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;@468bba6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:39:14,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:39:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 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-11-08 23:39:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:39:14,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:14,185 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, 1] [2024-11-08 23:39:14,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:14,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1620081931, now seen corresponding path program 1 times [2024-11-08 23:39:14,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:39:14,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285793028] [2024-11-08 23:39:14,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:14,202 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-11-08 23:39:14,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:39:14,205 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-11-08 23:39:14,206 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-11-08 23:39:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:14,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:39:14,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:39:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-08 23:39:14,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:39:14,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:39:14,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285793028] [2024-11-08 23:39:14,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285793028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:39:14,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:39:14,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:39:14,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369379049] [2024-11-08 23:39:14,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:39:14,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:39:14,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:39:14,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:39:14,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:39:14,521 INFO L87 Difference]: Start difference. First operand has 55 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-11-08 23:39:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:39:14,546 INFO L93 Difference]: Finished difference Result 107 states and 174 transitions. [2024-11-08 23:39:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:39:14,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 110 [2024-11-08 23:39:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:39:14,558 INFO L225 Difference]: With dead ends: 107 [2024-11-08 23:39:14,559 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 23:39:14,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-11-08 23:39:14,565 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:39:14,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:39:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 23:39:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 23:39:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.21875) internal successors, (39), 32 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-11-08 23:39:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-08 23:39:14,597 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 110 [2024-11-08 23:39:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:39:14,597 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-08 23:39:14,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-11-08 23:39:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-08 23:39:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:39:14,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:14,600 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, 1] [2024-11-08 23:39:14,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:39:14,803 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-11-08 23:39:14,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:14,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:14,805 INFO L85 PathProgramCache]: Analyzing trace with hash 93630981, now seen corresponding path program 1 times [2024-11-08 23:39:14,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:39:14,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527562984] [2024-11-08 23:39:14,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:14,806 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-11-08 23:39:14,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:39:14,810 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-11-08 23:39:14,811 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-11-08 23:39:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:14,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:39:14,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:39:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:39:14,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:39:14,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:39:14,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527562984] [2024-11-08 23:39:14,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527562984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:39:14,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:39:14,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:39:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263180255] [2024-11-08 23:39:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:39:14,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:39:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:39:14,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:39:14,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:39:14,992 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11-08 23:39:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:39:15,353 INFO L93 Difference]: Finished difference Result 135 states and 193 transitions. [2024-11-08 23:39:15,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:39:15,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 110 [2024-11-08 23:39:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:39:15,357 INFO L225 Difference]: With dead ends: 135 [2024-11-08 23:39:15,357 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 23:39:15,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 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-11-08 23:39:15,360 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:39:15,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 130 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:39:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 23:39:15,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-08 23:39:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 53 states have internal predecessors, (61), 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-11-08 23:39:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2024-11-08 23:39:15,390 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 110 [2024-11-08 23:39:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:39:15,391 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2024-11-08 23:39:15,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11-08 23:39:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-11-08 23:39:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:39:15,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:39:15,393 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, 1] [2024-11-08 23:39:15,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:39:15,593 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-11-08 23:39:15,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:39:15,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:39:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1681376381, now seen corresponding path program 1 times [2024-11-08 23:39:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:39:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293400902] [2024-11-08 23:39:15,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:39:15,597 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-11-08 23:39:15,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:39:15,599 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-11-08 23:39:15,602 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-11-08 23:39:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:39:15,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 23:39:15,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:40:16,388 WARN L286 SmtUtils]: Spent 5.69s 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)