./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:56:13,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:56:13,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:56:13,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:56:13,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:56:13,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:56:13,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:56:13,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:56:13,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:56:13,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:56:13,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:56:13,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:56:13,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:56:13,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:56:13,575 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:56:13,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:56:13,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:56:13,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:56:13,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:56:13,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:56:13,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:56:13,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:56:13,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:56:13,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:56:13,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:56:13,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:56:13,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:56:13,580 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:56:13,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:56:13,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:56:13,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:56:13,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:56:13,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:56:13,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:56:13,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:56:13,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:56:13,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:56:13,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:56:13,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:56:13,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:56:13,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:56:13,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:56:13,583 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 [2024-11-18 22:56:13,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:56:13,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:56:13,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:56:13,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:56:13,775 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:56:13,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2024-11-18 22:56:14,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:56:15,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:56:15,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2024-11-18 22:56:15,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53422728/70e497df82fb4af292bb83345ef84d65/FLAGd272d2fe4 [2024-11-18 22:56:15,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53422728/70e497df82fb4af292bb83345ef84d65 [2024-11-18 22:56:15,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:56:15,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:56:15,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:56:15,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:56:15,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:56:15,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fa2bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15, skipping insertion in model container [2024-11-18 22:56:15,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:56:15,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i[915,928] [2024-11-18 22:56:15,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:56:15,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:56:15,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i[915,928] [2024-11-18 22:56:15,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:56:15,701 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:56:15,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15 WrapperNode [2024-11-18 22:56:15,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:56:15,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:56:15,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:56:15,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:56:15,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,732 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-18 22:56:15,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:56:15,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:56:15,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:56:15,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:56:15,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,753 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:56:15,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:56:15,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:56:15,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:56:15,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:56:15,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (1/1) ... [2024-11-18 22:56:15,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:56:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:56:15,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:56:15,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:56:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:56:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:56:15,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:56:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:56:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:56:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:56:15,886 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:56:15,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:56:16,083 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-18 22:56:16,087 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:56:16,098 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:56:16,099 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:56:16,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:16 BoogieIcfgContainer [2024-11-18 22:56:16,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:56:16,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:56:16,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:56:16,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:56:16,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:56:15" (1/3) ... [2024-11-18 22:56:16,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379a2463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:56:16, skipping insertion in model container [2024-11-18 22:56:16,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:15" (2/3) ... [2024-11-18 22:56:16,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379a2463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:56:16, skipping insertion in model container [2024-11-18 22:56:16,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:16" (3/3) ... [2024-11-18 22:56:16,108 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-53.i [2024-11-18 22:56:16,121 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:56:16,122 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:56:16,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:56:16,188 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;@669e49e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:56:16,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:56:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:56:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 22:56:16,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:56:16,202 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:56:16,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:56:16,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:56:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash 429983085, now seen corresponding path program 1 times [2024-11-18 22:56:16,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:56:16,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410601939] [2024-11-18 22:56:16,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:56:16,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:56:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:56:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-18 22:56:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:56:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410601939] [2024-11-18 22:56:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410601939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:56:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973519403] [2024-11-18 22:56:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:56:16,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:56:16,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:56:16,445 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:56:16,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 22:56:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:56:16,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:56:16,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:56:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-18 22:56:16,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:56:16,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973519403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:56:16,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:56:16,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:56:16,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622757342] [2024-11-18 22:56:16,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:56:16,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:56:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:56:16,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:56:16,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:56:16,642 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 22:56:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:56:16,658 INFO L93 Difference]: Finished difference Result 93 states and 154 transitions. [2024-11-18 22:56:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:56:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-18 22:56:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:56:16,665 INFO L225 Difference]: With dead ends: 93 [2024-11-18 22:56:16,665 INFO L226 Difference]: Without dead ends: 46 [2024-11-18 22:56:16,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:56:16,669 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:56:16,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:56:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-18 22:56:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-18 22:56:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:56:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-18 22:56:16,698 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 102 [2024-11-18 22:56:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:56:16,698 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-18 22:56:16,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 22:56:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-18 22:56:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 22:56:16,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:56:16,700 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:56:16,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 22:56:16,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:56:16,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:56:16,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:56:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash -620017035, now seen corresponding path program 1 times [2024-11-18 22:56:16,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:56:16,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130696938] [2024-11-18 22:56:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:56:16,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:56:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:56:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 159 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-18 22:56:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:56:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130696938] [2024-11-18 22:56:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130696938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:56:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452808456] [2024-11-18 22:56:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:56:18,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:56:18,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:56:18,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:56:18,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 22:56:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:56:18,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-18 22:56:18,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:56:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 184 proven. 174 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-18 22:56:20,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:56:22,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452808456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:56:22,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 22:56:22,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 27 [2024-11-18 22:56:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22255467] [2024-11-18 22:56:22,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 22:56:22,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-18 22:56:22,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:56:22,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-18 22:56:22,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2024-11-18 22:56:22,950 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 10 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (31), 10 states have call predecessors, (31), 10 states have call successors, (31) [2024-11-18 22:56:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:56:28,235 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2024-11-18 22:56:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-18 22:56:28,236 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 10 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (31), 10 states have call predecessors, (31), 10 states have call successors, (31) Word has length 102 [2024-11-18 22:56:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:56:28,241 INFO L225 Difference]: With dead ends: 142 [2024-11-18 22:56:28,241 INFO L226 Difference]: Without dead ends: 99 [2024-11-18 22:56:28,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=515, Invalid=2035, Unknown=0, NotChecked=0, Total=2550 [2024-11-18 22:56:28,243 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 171 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 22:56:28,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 488 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 22:56:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-18 22:56:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2024-11-18 22:56:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:56:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2024-11-18 22:56:28,258 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 102 [2024-11-18 22:56:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:56:28,259 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2024-11-18 22:56:28,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 10 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (31), 10 states have call predecessors, (31), 10 states have call successors, (31) [2024-11-18 22:56:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2024-11-18 22:56:28,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 22:56:28,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:56:28,261 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:56:28,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 22:56:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-18 22:56:28,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:56:28,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:56:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1154990327, now seen corresponding path program 1 times [2024-11-18 22:56:28,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:56:28,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851958544] [2024-11-18 22:56:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:56:28,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:56:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:56:28,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:56:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:56:28,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:56:28,609 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:56:28,611 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:56:28,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:56:28,614 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-18 22:56:28,683 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:56:28,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:56:28 BoogieIcfgContainer [2024-11-18 22:56:28,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:56:28,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:56:28,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:56:28,689 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:56:28,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:16" (3/4) ... [2024-11-18 22:56:28,691 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:56:28,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:56:28,692 INFO L158 Benchmark]: Toolchain (without parser) took 13193.68ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 137.9MB in the beginning and 74.5MB in the end (delta: 63.4MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2024-11-18 22:56:28,693 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 132.1MB. Free memory was 93.8MB in the beginning and 93.7MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:56:28,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.94ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 123.6MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 22:56:28,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.38ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:56:28,694 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 118.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:56:28,694 INFO L158 Benchmark]: RCFGBuilder took 338.22ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 104.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 22:56:28,695 INFO L158 Benchmark]: TraceAbstraction took 12585.13ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 103.3MB in the beginning and 75.6MB in the end (delta: 27.8MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-11-18 22:56:28,695 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 201.3MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:56:28,696 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.11ms. Allocated memory is still 132.1MB. Free memory was 93.8MB in the beginning and 93.7MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.94ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 123.6MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.38ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 118.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 338.22ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 104.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12585.13ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 103.3MB in the beginning and 75.6MB in the end (delta: 27.8MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 201.3MB. Free memory is still 74.5MB. 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 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 500; [L24] unsigned long int var_1_3 = 1456677701; [L25] unsigned long int var_1_4 = 1000000000; [L26] unsigned long int var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_11 = 0; [L31] float var_1_12 = 128.6; [L32] float var_1_13 = 500.4; [L33] float var_1_14 = 8.5; [L34] double var_1_15 = 255.8; [L35] double var_1_16 = 25.75; [L36] float var_1_17 = 1.2; [L37] float var_1_18 = 9.6; VAL [isInitial=0, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=500, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L62] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L62] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L63] var_1_3 = __VERIFIER_nondet_ulong() [L64] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L64] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L66] var_1_4 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L67] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L68] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L68] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L69] var_1_5 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L71] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_8=0] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_8=0] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L75] var_1_11 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L76] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L77] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L77] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L78] var_1_13 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L79] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L80] var_1_14 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L81] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L82] var_1_16 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L83] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L84] var_1_18 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L85] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L98] RET updateVariables() [L99] CALL step() [L41] var_1_1 = (var_1_2 + (var_1_3 - (var_1_4 - var_1_5))) [L42] var_1_6 = var_1_7 [L43] var_1_12 = ((2.55f + var_1_13) - var_1_14) [L44] var_1_15 = ((((var_1_13) > (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))) ? (var_1_13) : (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) VAL [isInitial=1, var_1_11=-255, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=4294967294, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L45] COND FALSE !(var_1_2 >= var_1_1) VAL [isInitial=1, var_1_11=-255, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=4294967294, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L48] unsigned long int stepLocal_0 = (((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)); VAL [isInitial=1, stepLocal_0=4831838207, var_1_11=-255, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=4294967294, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L49] COND FALSE !(((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) != stepLocal_0) [L56] var_1_8 = var_1_11 VAL [isInitial=1, var_1_11=-255, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=4294967294, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=-255] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return (((((var_1_1 == ((unsigned long int) (var_1_2 + (var_1_3 - (var_1_4 - var_1_5))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_17 == var_1_12) ? (var_1_6 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && (var_1_12 == ((float) ((2.55f + var_1_13) - var_1_14)))) && (var_1_15 == ((double) ((((var_1_13) > (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))) ? (var_1_13) : (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))))))) && ((var_1_2 >= var_1_1) ? (var_1_17 == ((float) (var_1_14 - ((((var_1_13) > (var_1_18)) ? (var_1_13) : (var_1_18)))))) : 1) ; VAL [\result=0, isInitial=1, var_1_11=-255, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=4294967294, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=-255] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=-255, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=4294967294, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=-255] [L19] reach_error() VAL [isInitial=1, var_1_11=-255, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=4294967294, var_1_2=2147483647, var_1_3=2147483647, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 553 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 425 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 713 IncrementalHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 128 mSDtfsCounter, 713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, InterpolantAutomatonStates: 35, 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, 27 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 3780 SizeOfPredicates, 5 NumberOfNonLiveVariables, 478 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1557/1920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 22:56:28,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:56:30,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:56:30,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:56:30,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:56:30,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:56:30,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:56:30,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:56:30,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:56:30,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:56:30,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:56:30,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:56:30,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:56:30,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:56:30,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:56:30,537 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:56:30,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:56:30,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:56:30,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:56:30,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:56:30,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:56:30,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:56:30,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:56:30,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:56:30,541 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:56:30,541 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:56:30,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:56:30,541 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:56:30,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:56:30,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:56:30,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:56:30,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:56:30,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:56:30,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:56:30,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:56:30,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:56:30,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:56:30,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:56:30,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:56:30,543 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:56:30,543 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:56:30,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:56:30,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:56:30,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:56:30,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:56:30,546 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 [2024-11-18 22:56:30,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:56:30,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:56:30,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:56:30,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:56:30,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:56:30,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2024-11-18 22:56:32,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:56:32,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:56:32,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2024-11-18 22:56:32,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23aa44427/5ee8f902d1cb4d3bab18778bd3604809/FLAG2268d1bd1 [2024-11-18 22:56:32,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23aa44427/5ee8f902d1cb4d3bab18778bd3604809 [2024-11-18 22:56:32,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:56:32,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:56:32,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:56:32,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:56:32,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:56:32,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f935776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32, skipping insertion in model container [2024-11-18 22:56:32,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:56:32,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i[915,928] [2024-11-18 22:56:32,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:56:32,535 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:56:32,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i[915,928] [2024-11-18 22:56:32,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:56:32,596 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:56:32,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32 WrapperNode [2024-11-18 22:56:32,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:56:32,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:56:32,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:56:32,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:56:32,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,635 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-18 22:56:32,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:56:32,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:56:32,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:56:32,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:56:32,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,669 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:56:32,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:56:32,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:56:32,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:56:32,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:56:32,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (1/1) ... [2024-11-18 22:56:32,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:56:32,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:56:32,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:56:32,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:56:32,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:56:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:56:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:56:32,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:56:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:56:32,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:56:32,835 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:56:32,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:56:35,103 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-18 22:56:35,103 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:56:35,112 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:56:35,112 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:56:35,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:35 BoogieIcfgContainer [2024-11-18 22:56:35,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:56:35,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:56:35,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:56:35,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:56:35,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:56:32" (1/3) ... [2024-11-18 22:56:35,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddd4404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:56:35, skipping insertion in model container [2024-11-18 22:56:35,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:32" (2/3) ... [2024-11-18 22:56:35,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddd4404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:56:35, skipping insertion in model container [2024-11-18 22:56:35,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:35" (3/3) ... [2024-11-18 22:56:35,119 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-53.i [2024-11-18 22:56:35,132 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:56:35,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:56:35,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:56:35,206 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;@b069a8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:56:35,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:56:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:56:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 22:56:35,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:56:35,220 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:56:35,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:56:35,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:56:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash 429983085, now seen corresponding path program 1 times [2024-11-18 22:56:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:56:35,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25490423] [2024-11-18 22:56:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:56:35,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:56:35,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:56:35,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:56:35,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 22:56:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:56:35,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:56:35,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:56:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-18 22:56:35,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:56:35,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:56:35,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25490423] [2024-11-18 22:56:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25490423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:56:35,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:56:35,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:56:35,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924935263] [2024-11-18 22:56:35,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:56:35,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:56:35,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:56:35,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:56:35,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:56:35,585 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 22:56:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:56:35,606 INFO L93 Difference]: Finished difference Result 93 states and 154 transitions. [2024-11-18 22:56:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:56:35,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-18 22:56:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:56:35,613 INFO L225 Difference]: With dead ends: 93 [2024-11-18 22:56:35,613 INFO L226 Difference]: Without dead ends: 46 [2024-11-18 22:56:35,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:56:35,618 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:56:35,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:56:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-18 22:56:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-18 22:56:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:56:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-18 22:56:35,650 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 102 [2024-11-18 22:56:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:56:35,650 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-18 22:56:35,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 22:56:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-18 22:56:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 22:56:35,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:56:35,652 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:56:35,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-18 22:56:35,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:56:35,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:56:35,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:56:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash -620017035, now seen corresponding path program 1 times [2024-11-18 22:56:35,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:56:35,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236513710] [2024-11-18 22:56:35,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:56:35,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:56:35,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:56:35,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:56:35,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 22:56:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:56:36,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-18 22:56:36,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:57:09,687 WARN L286 SmtUtils]: Spent 9.71s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)