./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 361ad7309330d0980d27cf62f0ef032c1e20901880e67356d6799ee9da9467a8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:40:11,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:40:11,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:40:11,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:40:11,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:40:11,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:40:11,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:40:11,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:40:11,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:40:11,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:40:11,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:40:11,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:40:11,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:40:11,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:40:11,487 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:40:11,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:40:11,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:40:11,488 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:40:11,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:40:11,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:40:11,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:40:11,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:40:11,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:40:11,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:40:11,491 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:40:11,491 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:40:11,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:40:11,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:40:11,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:40:11,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:40:11,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:40:11,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:40:11,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:40:11,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:40:11,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:40:11,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:40:11,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:40:11,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:40:11,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:40:11,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:40:11,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:40:11,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:40:11,501 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-clean/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-clean/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 -> 361ad7309330d0980d27cf62f0ef032c1e20901880e67356d6799ee9da9467a8 [2024-10-11 11:40:11,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:40:11,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:40:11,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:40:11,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:40:11,782 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:40:11,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i [2024-10-11 11:40:13,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:40:13,413 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:40:13,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i [2024-10-11 11:40:13,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1645618b/6ddf8961c28d450abf5b36e2653cd659/FLAGc586213c4 [2024-10-11 11:40:13,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1645618b/6ddf8961c28d450abf5b36e2653cd659 [2024-10-11 11:40:13,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:40:13,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:40:13,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:40:13,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:40:13,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:40:13,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2197d4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13, skipping insertion in model container [2024-10-11 11:40:13,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:40:13,634 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i[915,928] [2024-10-11 11:40:13,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:40:13,678 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:40:13,691 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i[915,928] [2024-10-11 11:40:13,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:40:13,728 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:40:13,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13 WrapperNode [2024-10-11 11:40:13,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:40:13,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:40:13,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:40:13,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:40:13,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,780 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-11 11:40:13,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:40:13,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:40:13,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:40:13,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:40:13,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,814 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:40:13,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:40:13,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:40:13,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:40:13,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:40:13,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (1/1) ... [2024-10-11 11:40:13,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:40:13,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:40:13,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:40:13,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:40:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:40:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:40:13,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:40:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:40:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:40:13,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:40:14,059 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:40:14,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:40:14,337 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 11:40:14,337 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:40:14,378 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:40:14,380 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:40:14,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:40:14 BoogieIcfgContainer [2024-10-11 11:40:14,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:40:14,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:40:14,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:40:14,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:40:14,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:40:13" (1/3) ... [2024-10-11 11:40:14,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dff431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:40:14, skipping insertion in model container [2024-10-11 11:40:14,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:13" (2/3) ... [2024-10-11 11:40:14,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dff431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:40:14, skipping insertion in model container [2024-10-11 11:40:14,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:40:14" (3/3) ... [2024-10-11 11:40:14,392 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-61.i [2024-10-11 11:40:14,411 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:40:14,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:40:14,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:40:14,493 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;@13ed8d9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:40:14,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:40:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:40:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 11:40:14,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:40:14,510 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:40:14,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:40:14,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:40:14,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1472934784, now seen corresponding path program 1 times [2024-10-11 11:40:14,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:40:14,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133457886] [2024-10-11 11:40:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:40:14,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:40:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:40:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:40:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:40:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:40:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:40:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:40:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:40:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:40:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:40:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:40:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:40:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:40:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:40:14,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:40:14,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133457886] [2024-10-11 11:40:14,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133457886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:40:14,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:40:14,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:40:14,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897410120] [2024-10-11 11:40:14,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:40:14,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:40:14,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:40:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:40:14,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:40:14,944 INFO L87 Difference]: Start difference. First operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:40:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:40:14,991 INFO L93 Difference]: Finished difference Result 93 states and 154 transitions. [2024-10-11 11:40:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:40:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-10-11 11:40:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:40:15,001 INFO L225 Difference]: With dead ends: 93 [2024-10-11 11:40:15,002 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 11:40:15,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:40:15,008 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:40:15,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:40:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 11:40:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 11:40:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:40:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2024-10-11 11:40:15,047 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 79 [2024-10-11 11:40:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:40:15,047 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2024-10-11 11:40:15,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:40:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2024-10-11 11:40:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 11:40:15,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:40:15,053 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:40:15,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:40:15,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:40:15,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:40:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472572, now seen corresponding path program 1 times [2024-10-11 11:40:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:40:15,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021005221] [2024-10-11 11:40:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:40:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:40:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:40:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:40:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:40:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:40:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:40:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:40:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:40:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:40:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:40:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:40:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:40:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:40:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 11:40:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:40:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021005221] [2024-10-11 11:40:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021005221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:40:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117439460] [2024-10-11 11:40:15,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:40:15,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:40:15,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:40:15,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:40:15,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:40:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:15,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:40:15,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:40:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 11:40:15,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:40:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 11:40:16,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117439460] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:40:16,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:40:16,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 11:40:16,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376882002] [2024-10-11 11:40:16,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:40:16,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:40:16,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:40:16,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:40:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:40:16,114 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 11:40:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:40:16,328 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2024-10-11 11:40:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:40:16,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 79 [2024-10-11 11:40:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:40:16,330 INFO L225 Difference]: With dead ends: 110 [2024-10-11 11:40:16,331 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 11:40:16,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:40:16,332 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 74 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:40:16,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 132 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:40:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 11:40:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-10-11 11:40:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 11:40:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2024-10-11 11:40:16,347 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 79 [2024-10-11 11:40:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:40:16,348 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2024-10-11 11:40:16,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 11:40:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2024-10-11 11:40:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 11:40:16,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:40:16,350 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:40:16,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:40:16,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:40:16,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:40:16,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:40:16,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1131868638, now seen corresponding path program 1 times [2024-10-11 11:40:16,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:40:16,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622668012] [2024-10-11 11:40:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:40:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:40:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:40:16,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:40:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:40:16,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:40:16,693 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:40:16,694 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:40:16,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:40:16,700 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:40:16,762 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:40:16,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:40:16 BoogieIcfgContainer [2024-10-11 11:40:16,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:40:16,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:40:16,769 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:40:16,769 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:40:16,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:40:14" (3/4) ... [2024-10-11 11:40:16,771 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:40:16,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:40:16,773 INFO L158 Benchmark]: Toolchain (without parser) took 3335.80ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 81.3MB in the beginning and 126.2MB in the end (delta: -44.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:40:16,773 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:40:16,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.06ms. Allocated memory is still 134.2MB. Free memory was 81.3MB in the beginning and 67.5MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:40:16,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.05ms. Allocated memory is still 134.2MB. Free memory was 67.5MB in the beginning and 64.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:40:16,774 INFO L158 Benchmark]: Boogie Preprocessor took 64.58ms. Allocated memory is still 134.2MB. Free memory was 64.1MB in the beginning and 60.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:40:16,774 INFO L158 Benchmark]: RCFGBuilder took 533.89ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 60.3MB in the beginning and 119.5MB in the end (delta: -59.2MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-10-11 11:40:16,775 INFO L158 Benchmark]: TraceAbstraction took 2384.48ms. Allocated memory is still 163.6MB. Free memory was 118.5MB in the beginning and 126.2MB in the end (delta: -7.7MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2024-10-11 11:40:16,775 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 163.6MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:40:16,781 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.18ms. Allocated memory is still 134.2MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.06ms. Allocated memory is still 134.2MB. Free memory was 81.3MB in the beginning and 67.5MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.05ms. Allocated memory is still 134.2MB. Free memory was 67.5MB in the beginning and 64.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.58ms. Allocated memory is still 134.2MB. Free memory was 64.1MB in the beginning and 60.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 533.89ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 60.3MB in the beginning and 119.5MB in the end (delta: -59.2MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2384.48ms. Allocated memory is still 163.6MB. Free memory was 118.5MB in the beginning and 126.2MB in the end (delta: -7.7MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 163.6MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 128.6; [L24] float var_1_3 = 49.4; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 8; [L29] unsigned char var_1_8 = 128; [L30] unsigned char var_1_9 = 64; [L31] signed short int var_1_10 = 5; [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] FCALL updateLastVariables() [L92] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L62] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L64] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L65] var_1_4 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L66] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L67] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L67] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L68] var_1_5 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L69] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L70] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L72] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L75] RET assume_abort_if_not(var_1_8 >= 127) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L76] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2] [L79] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L79] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L92] RET updateVariables() [L93] CALL step() [L35] COND TRUE var_1_2 < var_1_3 [L36] var_1_1 = (var_1_4 || var_1_5) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L44] COND TRUE \read(var_1_6) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L45] COND TRUE var_1_3 != 15.8f [L46] var_1_7 = (var_1_8 - var_1_9) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L53] EXPR (var_1_9 / 32) << var_1_8 VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L53] signed long int stepLocal_0 = (var_1_9 / 32) << var_1_8; [L54] COND FALSE !(! (var_1_3 < var_1_2)) VAL [isInitial=1, stepLocal_0=0, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR (((var_1_2 < var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : ((var_1_3 >= var_1_2) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_6)))) && (var_1_6 ? ((var_1_3 != 15.8f) ? (var_1_7 == ((unsigned char) (var_1_8 - var_1_9))) : (var_1_7 == ((unsigned char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)))))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((! (var_1_3 < var_1_2)) ? ((((var_1_9 / 32) << var_1_8) == var_1_7) ? (var_1_10 == ((signed short int) (var_1_7 - var_1_8))) : 1) : 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L84-L85] return (((var_1_2 < var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : ((var_1_3 >= var_1_2) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_6)))) && (var_1_6 ? ((var_1_3 != 15.8f) ? (var_1_7 == ((unsigned char) (var_1_8 - var_1_9))) : (var_1_7 == ((unsigned char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)))))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((! (var_1_3 < var_1_2)) ? ((((var_1_9 / 32) << var_1_8) == var_1_7) ? (var_1_10 == ((signed short int) (var_1_7 - var_1_8))) : 1) : 1) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 123 mSDtfsCounter, 113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 215 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 SizeOfPredicates, 2 NumberOfNonLiveVariables, 181 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1011/1056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:40:16,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 361ad7309330d0980d27cf62f0ef032c1e20901880e67356d6799ee9da9467a8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:40:18,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:40:19,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:40:19,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:40:19,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:40:19,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:40:19,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:40:19,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:40:19,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:40:19,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:40:19,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:40:19,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:40:19,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:40:19,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:40:19,131 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:40:19,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:40:19,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:40:19,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:40:19,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:40:19,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:40:19,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:40:19,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:40:19,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:40:19,138 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:40:19,138 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:40:19,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:40:19,138 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:40:19,139 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:40:19,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:40:19,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:40:19,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:40:19,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:40:19,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:40:19,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:40:19,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:40:19,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:40:19,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:40:19,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:40:19,143 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:40:19,144 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:40:19,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:40:19,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:40:19,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:40:19,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:40:19,145 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:40:19,146 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-clean/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-clean/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 -> 361ad7309330d0980d27cf62f0ef032c1e20901880e67356d6799ee9da9467a8 [2024-10-11 11:40:19,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:40:19,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:40:19,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:40:19,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:40:19,500 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:40:19,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i [2024-10-11 11:40:21,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:40:21,242 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:40:21,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i [2024-10-11 11:40:21,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5edbe54b2/aeccd649da13405faa5a411da7705fa8/FLAG4e05596d4 [2024-10-11 11:40:21,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5edbe54b2/aeccd649da13405faa5a411da7705fa8 [2024-10-11 11:40:21,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:40:21,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:40:21,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:40:21,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:40:21,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:40:21,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20943da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21, skipping insertion in model container [2024-10-11 11:40:21,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:40:21,530 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i[915,928] [2024-10-11 11:40:21,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:40:21,595 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:40:21,611 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-61.i[915,928] [2024-10-11 11:40:21,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:40:21,654 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:40:21,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21 WrapperNode [2024-10-11 11:40:21,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:40:21,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:40:21,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:40:21,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:40:21,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,702 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-11 11:40:21,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:40:21,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:40:21,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:40:21,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:40:21,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,741 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:40:21,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:40:21,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:40:21,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:40:21,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:40:21,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (1/1) ... [2024-10-11 11:40:21,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:40:21,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:40:21,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:40:21,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:40:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:40:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:40:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:40:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:40:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:40:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:40:21,928 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:40:21,931 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:40:22,196 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 11:40:22,197 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:40:22,266 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:40:22,266 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:40:22,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:40:22 BoogieIcfgContainer [2024-10-11 11:40:22,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:40:22,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:40:22,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:40:22,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:40:22,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:40:21" (1/3) ... [2024-10-11 11:40:22,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174adcd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:40:22, skipping insertion in model container [2024-10-11 11:40:22,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:21" (2/3) ... [2024-10-11 11:40:22,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174adcd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:40:22, skipping insertion in model container [2024-10-11 11:40:22,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:40:22" (3/3) ... [2024-10-11 11:40:22,276 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-61.i [2024-10-11 11:40:22,293 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:40:22,293 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:40:22,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:40:22,370 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;@1be52dda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:40:22,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:40:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:40:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 11:40:22,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:40:22,385 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:40:22,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:40:22,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:40:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash 186350007, now seen corresponding path program 1 times [2024-10-11 11:40:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:40:22,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722937105] [2024-10-11 11:40:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:40:22,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:40:22,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:40:22,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:40:22,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:40:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:22,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:40:22,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:40:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-11 11:40:22,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:40:22,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:40:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722937105] [2024-10-11 11:40:22,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722937105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:40:22,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:40:22,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:40:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484018706] [2024-10-11 11:40:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:40:22,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:40:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:40:22,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:40:22,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:40:22,666 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:40:22,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:40:22,708 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2024-10-11 11:40:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:40:22,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 76 [2024-10-11 11:40:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:40:22,718 INFO L225 Difference]: With dead ends: 75 [2024-10-11 11:40:22,718 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 11:40:22,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:40:22,727 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:40:22,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:40:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 11:40:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 11:40:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:40:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2024-10-11 11:40:22,777 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 76 [2024-10-11 11:40:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:40:22,778 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-10-11 11:40:22,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:40:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2024-10-11 11:40:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 11:40:22,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:40:22,795 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:40:22,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:40:22,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:40:23,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:40:23,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:40:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash -224680717, now seen corresponding path program 1 times [2024-10-11 11:40:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:40:23,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364653340] [2024-10-11 11:40:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:40:23,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:40:23,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:40:23,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:40:23,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:40:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:23,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 11:40:23,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:40:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 11:40:23,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:40:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 11:40:23,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:40:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364653340] [2024-10-11 11:40:23,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364653340] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:40:23,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:40:23,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 11:40:23,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17865180] [2024-10-11 11:40:23,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:40:23,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:40:23,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:40:23,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:40:23,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:40:23,520 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 11:40:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:40:23,795 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2024-10-11 11:40:23,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:40:23,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 76 [2024-10-11 11:40:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:40:23,799 INFO L225 Difference]: With dead ends: 92 [2024-10-11 11:40:23,799 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 11:40:23,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:40:23,801 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:40:23,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 96 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:40:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 11:40:23,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-10-11 11:40:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 11:40:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-10-11 11:40:23,827 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 76 [2024-10-11 11:40:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:40:23,828 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-10-11 11:40:23,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 11:40:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-10-11 11:40:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 11:40:23,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:40:23,833 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:40:23,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 11:40:24,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:40:24,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:40:24,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:40:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1392529085, now seen corresponding path program 1 times [2024-10-11 11:40:24,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:40:24,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332920725] [2024-10-11 11:40:24,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:40:24,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:40:24,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:40:24,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:40:24,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:40:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:24,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 11:40:24,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:40:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 11:40:24,710 INFO L311 TraceCheckSpWp]: Computing backward predicates...