./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.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_codestructure_steplocals_file-9.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 a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 18:54:11,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 18:54:11,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 18:54:11,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 18:54:11,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 18:54:11,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 18:54:11,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 18:54:11,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 18:54:11,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 18:54:11,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 18:54:11,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 18:54:11,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 18:54:11,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 18:54:11,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 18:54:11,387 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 18:54:11,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 18:54:11,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 18:54:11,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 18:54:11,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 18:54:11,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 18:54:11,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 18:54:11,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 18:54:11,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 18:54:11,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 18:54:11,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 18:54:11,393 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 18:54:11,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 18:54:11,393 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 18:54:11,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 18:54:11,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 18:54:11,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 18:54:11,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 18:54:11,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:54:11,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 18:54:11,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 18:54:11,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 18:54:11,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 18:54:11,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 18:54:11,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 18:54:11,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 18:54:11,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 18:54:11,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 18:54:11,397 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 -> a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c [2024-11-18 18:54:11,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 18:54:11,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 18:54:11,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 18:54:11,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 18:54:11,637 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 18:54:11,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i [2024-11-18 18:54:12,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 18:54:12,984 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 18:54:12,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i [2024-11-18 18:54:12,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1219518/7ca4cd23bf80462590b22f69abc5bce4/FLAG1f66201d0 [2024-11-18 18:54:13,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1219518/7ca4cd23bf80462590b22f69abc5bce4 [2024-11-18 18:54:13,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 18:54:13,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 18:54:13,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 18:54:13,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 18:54:13,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 18:54:13,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2690e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13, skipping insertion in model container [2024-11-18 18:54:13,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 18:54:13,559 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_codestructure_steplocals_file-9.i[916,929] [2024-11-18 18:54:13,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:54:13,631 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 18:54:13,640 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_codestructure_steplocals_file-9.i[916,929] [2024-11-18 18:54:13,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:54:13,686 INFO L204 MainTranslator]: Completed translation [2024-11-18 18:54:13,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13 WrapperNode [2024-11-18 18:54:13,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 18:54:13,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 18:54:13,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 18:54:13,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 18:54:13,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,719 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-11-18 18:54:13,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 18:54:13,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 18:54:13,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 18:54:13,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 18:54:13,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,748 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 18:54:13,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 18:54:13,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 18:54:13,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 18:54:13,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 18:54:13,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (1/1) ... [2024-11-18 18:54:13,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:54:13,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:54:13,798 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 18:54:13,804 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 18:54:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 18:54:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 18:54:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 18:54:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 18:54:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 18:54:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 18:54:13,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 18:54:13,919 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 18:54:14,209 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-18 18:54:14,209 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 18:54:14,218 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 18:54:14,218 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 18:54:14,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:54:14 BoogieIcfgContainer [2024-11-18 18:54:14,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 18:54:14,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 18:54:14,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 18:54:14,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 18:54:14,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:54:13" (1/3) ... [2024-11-18 18:54:14,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ef847e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:54:14, skipping insertion in model container [2024-11-18 18:54:14,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:13" (2/3) ... [2024-11-18 18:54:14,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ef847e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:54:14, skipping insertion in model container [2024-11-18 18:54:14,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:54:14" (3/3) ... [2024-11-18 18:54:14,228 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-9.i [2024-11-18 18:54:14,241 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 18:54:14,241 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 18:54:14,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 18:54:14,296 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;@251f351e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 18:54:14,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 18:54:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 18:54:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-18 18:54:14,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:14,318 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:14,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:14,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:14,323 INFO L85 PathProgramCache]: Analyzing trace with hash -233058685, now seen corresponding path program 1 times [2024-11-18 18:54:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339594318] [2024-11-18 18:54:14,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-18 18:54:14,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:14,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339594318] [2024-11-18 18:54:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339594318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:54:14,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834043223] [2024-11-18 18:54:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:14,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:14,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:54:14,612 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 18:54:14,613 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 18:54:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:14,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 18:54:14,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:54:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-18 18:54:14,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:54:14,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834043223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:14,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 18:54:14,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 18:54:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755255627] [2024-11-18 18:54:14,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:14,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 18:54:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 18:54:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 18:54:14,816 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-18 18:54:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:14,867 INFO L93 Difference]: Finished difference Result 161 states and 265 transitions. [2024-11-18 18:54:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 18:54:14,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 143 [2024-11-18 18:54:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:14,875 INFO L225 Difference]: With dead ends: 161 [2024-11-18 18:54:14,875 INFO L226 Difference]: Without dead ends: 80 [2024-11-18 18:54:14,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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 18:54:14,880 INFO L432 NwaCegarLoop]: 118 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, 118 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 18:54:14,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:54:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-18 18:54:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-18 18:54:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 18:54:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-11-18 18:54:14,919 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 143 [2024-11-18 18:54:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:14,920 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-11-18 18:54:14,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-18 18:54:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-11-18 18:54:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-18 18:54:14,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:14,926 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:14,940 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 18:54:15,126 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 18:54:15,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:15,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:15,128 INFO L85 PathProgramCache]: Analyzing trace with hash -859617335, now seen corresponding path program 1 times [2024-11-18 18:54:15,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:15,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834511877] [2024-11-18 18:54:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:54:15,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:15,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834511877] [2024-11-18 18:54:15,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834511877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:15,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:15,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 18:54:15,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462586939] [2024-11-18 18:54:15,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:15,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 18:54:15,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 18:54:15,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 18:54:15,342 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 18:54:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:15,364 INFO L93 Difference]: Finished difference Result 158 states and 235 transitions. [2024-11-18 18:54:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 18:54:15,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-18 18:54:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:15,368 INFO L225 Difference]: With dead ends: 158 [2024-11-18 18:54:15,370 INFO L226 Difference]: Without dead ends: 81 [2024-11-18 18:54:15,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 18:54:15,372 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:15,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:54:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-18 18:54:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-18 18:54:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 18:54:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2024-11-18 18:54:15,386 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 143 [2024-11-18 18:54:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:15,387 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2024-11-18 18:54:15,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 18:54:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2024-11-18 18:54:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-18 18:54:15,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:15,390 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:15,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 18:54:15,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:15,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1358312091, now seen corresponding path program 1 times [2024-11-18 18:54:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445447759] [2024-11-18 18:54:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:54:16,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:16,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445447759] [2024-11-18 18:54:16,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445447759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:54:16,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787861825] [2024-11-18 18:54:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:16,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:16,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:54:16,854 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 18:54:16,855 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 18:54:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:16,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 18:54:16,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:54:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 456 proven. 54 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-18 18:54:17,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:54:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:54:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787861825] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 18:54:17,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 18:54:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2024-11-18 18:54:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143271015] [2024-11-18 18:54:17,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 18:54:17,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 18:54:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:17,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 18:54:17,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-18 18:54:17,542 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 5 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) [2024-11-18 18:54:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:18,698 INFO L93 Difference]: Finished difference Result 248 states and 350 transitions. [2024-11-18 18:54:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 18:54:18,698 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 5 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) Word has length 144 [2024-11-18 18:54:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:18,700 INFO L225 Difference]: With dead ends: 248 [2024-11-18 18:54:18,700 INFO L226 Difference]: Without dead ends: 170 [2024-11-18 18:54:18,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2024-11-18 18:54:18,702 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 464 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:18,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 443 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 18:54:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-18 18:54:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 142. [2024-11-18 18:54:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 115 states have internal predecessors, (153), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-18 18:54:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 199 transitions. [2024-11-18 18:54:18,717 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 199 transitions. Word has length 144 [2024-11-18 18:54:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:18,719 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 199 transitions. [2024-11-18 18:54:18,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 5 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) [2024-11-18 18:54:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 199 transitions. [2024-11-18 18:54:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-18 18:54:18,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:18,721 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:18,735 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 18:54:18,925 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,SelfDestructingSolverStorable2 [2024-11-18 18:54:18,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:18,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash -249562277, now seen corresponding path program 1 times [2024-11-18 18:54:18,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:18,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019664801] [2024-11-18 18:54:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:54:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019664801] [2024-11-18 18:54:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019664801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:54:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370652459] [2024-11-18 18:54:19,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:19,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:19,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:54:19,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 18:54:19,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 18:54:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:19,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 18:54:19,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:54:19,986 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 308 proven. 12 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-11-18 18:54:19,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:54:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:54:20,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370652459] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 18:54:20,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 18:54:20,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 19 [2024-11-18 18:54:20,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334845225] [2024-11-18 18:54:20,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:20,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 18:54:20,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:20,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 18:54:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-18 18:54:20,239 INFO L87 Difference]: Start difference. First operand 142 states and 199 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 18:54:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:20,475 INFO L93 Difference]: Finished difference Result 366 states and 497 transitions. [2024-11-18 18:54:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 18:54:20,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-18 18:54:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:20,479 INFO L225 Difference]: With dead ends: 366 [2024-11-18 18:54:20,480 INFO L226 Difference]: Without dead ends: 227 [2024-11-18 18:54:20,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-18 18:54:20,482 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 102 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:20,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 602 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 18:54:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-18 18:54:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 153. [2024-11-18 18:54:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.322314049586777) internal successors, (160), 122 states have internal predecessors, (160), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-18 18:54:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 210 transitions. [2024-11-18 18:54:20,505 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 210 transitions. Word has length 144 [2024-11-18 18:54:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:20,506 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 210 transitions. [2024-11-18 18:54:20,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 18:54:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 210 transitions. [2024-11-18 18:54:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-18 18:54:20,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:20,509 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:20,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 18:54:20,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:20,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:20,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash -816841825, now seen corresponding path program 1 times [2024-11-18 18:54:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581729356] [2024-11-18 18:54:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 18:54:21,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:21,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581729356] [2024-11-18 18:54:21,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581729356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:54:21,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504004987] [2024-11-18 18:54:21,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:21,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:21,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:54:21,719 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 18:54:21,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 18:54:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:21,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-18 18:54:21,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:54:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 514 proven. 162 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-18 18:54:23,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:54:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:54:23,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504004987] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 18:54:23,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 18:54:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 23] total 32 [2024-11-18 18:54:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99529318] [2024-11-18 18:54:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:23,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 18:54:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:23,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 18:54:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2024-11-18 18:54:23,704 INFO L87 Difference]: Start difference. First operand 153 states and 210 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 18:54:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:23,894 INFO L93 Difference]: Finished difference Result 334 states and 453 transitions. [2024-11-18 18:54:23,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 18:54:23,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-18 18:54:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:23,896 INFO L225 Difference]: With dead ends: 334 [2024-11-18 18:54:23,896 INFO L226 Difference]: Without dead ends: 184 [2024-11-18 18:54:23,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2024-11-18 18:54:23,897 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 79 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:23,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 500 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 18:54:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-18 18:54:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 144. [2024-11-18 18:54:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 112 states have internal predecessors, (142), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-18 18:54:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 192 transitions. [2024-11-18 18:54:23,916 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 192 transitions. Word has length 144 [2024-11-18 18:54:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:23,917 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 192 transitions. [2024-11-18 18:54:23,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 18:54:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 192 transitions. [2024-11-18 18:54:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 18:54:23,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:23,918 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:23,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 18:54:24,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:24,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:24,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:24,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1858690696, now seen corresponding path program 1 times [2024-11-18 18:54:24,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:24,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551025582] [2024-11-18 18:54:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 18:54:24,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:54:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551025582] [2024-11-18 18:54:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551025582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 18:54:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950976419] [2024-11-18 18:54:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:24,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 18:54:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:54:24,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 18:54:24,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 18:54:24,525 INFO L87 Difference]: Start difference. First operand 144 states and 192 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 18:54:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:24,781 INFO L93 Difference]: Finished difference Result 360 states and 486 transitions. [2024-11-18 18:54:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 18:54:24,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2024-11-18 18:54:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:24,783 INFO L225 Difference]: With dead ends: 360 [2024-11-18 18:54:24,783 INFO L226 Difference]: Without dead ends: 219 [2024-11-18 18:54:24,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 18:54:24,784 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 40 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 18:54:24,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 456 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 18:54:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-18 18:54:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 181. [2024-11-18 18:54:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 148 states have (on average 1.337837837837838) internal successors, (198), 149 states have internal predecessors, (198), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-18 18:54:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 248 transitions. [2024-11-18 18:54:24,795 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 248 transitions. Word has length 146 [2024-11-18 18:54:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:24,796 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 248 transitions. [2024-11-18 18:54:24,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 18:54:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 248 transitions. [2024-11-18 18:54:24,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 18:54:24,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:24,797 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:24,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 18:54:24,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:24,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2134511320, now seen corresponding path program 1 times [2024-11-18 18:54:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:54:24,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193543732] [2024-11-18 18:54:24,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:54:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 18:54:24,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986282886] [2024-11-18 18:54:24,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:24,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:24,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:54:24,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 18:54:24,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 18:54:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 18:54:25,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 18:54:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 18:54:25,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 18:54:25,143 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 18:54:25,144 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 18:54:25,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 18:54:25,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:54:25,348 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-18 18:54:25,442 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 18:54:25,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:54:25 BoogieIcfgContainer [2024-11-18 18:54:25,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 18:54:25,447 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 18:54:25,447 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 18:54:25,448 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 18:54:25,448 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:54:14" (3/4) ... [2024-11-18 18:54:25,450 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 18:54:25,451 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 18:54:25,451 INFO L158 Benchmark]: Toolchain (without parser) took 12059.19ms. Allocated memory was 155.2MB in the beginning and 360.7MB in the end (delta: 205.5MB). Free memory was 83.4MB in the beginning and 321.4MB in the end (delta: -238.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:54:25,451 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory was 106.7MB in the beginning and 106.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:54:25,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.53ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 83.1MB in the beginning and 178.2MB in the end (delta: -95.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-11-18 18:54:25,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.23ms. Allocated memory is still 207.6MB. Free memory was 178.2MB in the beginning and 175.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 18:54:25,452 INFO L158 Benchmark]: Boogie Preprocessor took 46.19ms. Allocated memory is still 207.6MB. Free memory was 175.0MB in the beginning and 171.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 18:54:25,452 INFO L158 Benchmark]: RCFGBuilder took 454.24ms. Allocated memory is still 207.6MB. Free memory was 171.9MB in the beginning and 149.9MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-18 18:54:25,453 INFO L158 Benchmark]: TraceAbstraction took 11223.56ms. Allocated memory was 207.6MB in the beginning and 360.7MB in the end (delta: 153.1MB). Free memory was 148.8MB in the beginning and 321.4MB in the end (delta: -172.6MB). Peak memory consumption was 185.0MB. Max. memory is 16.1GB. [2024-11-18 18:54:25,453 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 360.7MB. Free memory is still 321.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:54:25,454 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.15ms. Allocated memory is still 155.2MB. Free memory was 106.7MB in the beginning and 106.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.53ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 83.1MB in the beginning and 178.2MB in the end (delta: -95.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.23ms. Allocated memory is still 207.6MB. Free memory was 178.2MB in the beginning and 175.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.19ms. Allocated memory is still 207.6MB. Free memory was 175.0MB in the beginning and 171.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.24ms. Allocated memory is still 207.6MB. Free memory was 171.9MB in the beginning and 149.9MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11223.56ms. Allocated memory was 207.6MB in the beginning and 360.7MB in the end (delta: 153.1MB). Free memory was 148.8MB in the beginning and 321.4MB in the end (delta: -172.6MB). Peak memory consumption was 185.0MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 360.7MB. Free memory is still 321.4MB. 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 someBinaryDOUBLEComparisonOperation at line 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed char var_1_2 = 100; [L24] signed short int var_1_3 = 1; [L25] signed long int var_1_4 = -16; [L26] signed long int var_1_5 = -64; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 5; [L29] double var_1_8 = 16.25; [L30] double var_1_9 = 1.8; [L31] unsigned char var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] unsigned short int var_1_12 = 16; [L34] unsigned long int var_1_13 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned short int var_1_16 = 256; [L37] unsigned short int var_1_17 = 8; [L38] signed char var_1_18 = -2; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=100, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] FCALL updateLastVariables() [L133] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_3 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] var_1_5 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L100] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] var_1_6 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L103] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L104] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L104] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] var_1_7 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L106] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L107] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L107] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L108] var_1_8 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6, var_1_9=9/5] [L109] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6, var_1_9=9/5] [L110] var_1_9 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L111] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L112] var_1_11 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L113] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L114] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L114] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L115] var_1_15 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L116] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L117] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L117] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L118] var_1_17 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L119] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L120] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L120] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L133] RET updateVariables() [L134] CALL step() [L42] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L42] signed long int stepLocal_1 = var_1_2 >> var_1_3; [L43] EXPR var_1_3 << (var_1_6 - var_1_7) VAL [isInitial=1, stepLocal_1=0, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L43] signed long int stepLocal_0 = var_1_3 << (var_1_6 - var_1_7); [L44] COND FALSE !(stepLocal_1 == (var_1_4 / var_1_5)) VAL [isInitial=1, stepLocal_0=0, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L51] signed char stepLocal_2 = var_1_6; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=12, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L52] COND TRUE stepLocal_2 <= (var_1_4 + var_1_7) [L53] var_1_10 = var_1_11 VAL [isInitial=1, stepLocal_0=0, var_1_10=-2, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L57] COND TRUE ((var_1_6 >> 2) * var_1_10) > var_1_4 [L58] var_1_12 = var_1_6 VAL [isInitial=1, stepLocal_0=0, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L60] EXPR 1 << var_1_2 VAL [isInitial=1, stepLocal_0=0, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L60] COND TRUE (1 << var_1_2) != (-500 / -100) [L61] COND FALSE !((var_1_6 - var_1_3) >= (var_1_10 + 256)) [L64] var_1_13 = var_1_12 VAL [isInitial=1, stepLocal_0=0, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L69] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L70] unsigned short int stepLocal_3 = var_1_17; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=20, stepLocal_4=254, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=256, var_1_17=20, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L71] COND FALSE !((- var_1_9) <= var_1_8) [L84] var_1_16 = var_1_10 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=20, stepLocal_4=254, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=254, var_1_17=20, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L86] var_1_18 = var_1_3 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=20, stepLocal_4=254, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=254, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=254, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L125] EXPR ((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=254, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L125] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=254, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L125] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=254, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L125] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=254, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L125-L126] return (((((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_2) ? ((var_1_17 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=254, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] [L19] reach_error() VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=12, var_1_13=12, var_1_15=-255, var_1_16=254, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=6, var_1_5=5, var_1_6=12, var_1_7=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 687 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 685 mSDsluCounter, 2348 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1639 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1134 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 709 mSDtfsCounter, 1134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1071 GetRequests, 987 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 180 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1731 NumberOfCodeBlocks, 1731 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1858 ConstructedInterpolants, 0 QuantifiedInterpolants, 8320 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1302 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 10553/10920 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 18:54:25,487 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_codestructure_steplocals_file-9.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 a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 18:54:27,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 18:54:27,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 18:54:27,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 18:54:27,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 18:54:27,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 18:54:27,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 18:54:27,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 18:54:27,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 18:54:27,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 18:54:27,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 18:54:27,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 18:54:27,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 18:54:27,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 18:54:27,370 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 18:54:27,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 18:54:27,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 18:54:27,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 18:54:27,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 18:54:27,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 18:54:27,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 18:54:27,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 18:54:27,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 18:54:27,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 18:54:27,375 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 18:54:27,376 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 18:54:27,376 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 18:54:27,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 18:54:27,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 18:54:27,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 18:54:27,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 18:54:27,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 18:54:27,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 18:54:27,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 18:54:27,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:54:27,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 18:54:27,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 18:54:27,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 18:54:27,378 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 18:54:27,379 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 18:54:27,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 18:54:27,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 18:54:27,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 18:54:27,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 18:54:27,380 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 -> a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c [2024-11-18 18:54:27,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 18:54:27,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 18:54:27,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 18:54:27,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 18:54:27,662 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 18:54:27,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i [2024-11-18 18:54:28,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 18:54:29,077 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 18:54:29,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i [2024-11-18 18:54:29,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf0af948/c811f775c8d24872815498d0a0ccd619/FLAG997fab6f7 [2024-11-18 18:54:29,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf0af948/c811f775c8d24872815498d0a0ccd619 [2024-11-18 18:54:29,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 18:54:29,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 18:54:29,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 18:54:29,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 18:54:29,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 18:54:29,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793f7b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29, skipping insertion in model container [2024-11-18 18:54:29,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 18:54:29,631 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_codestructure_steplocals_file-9.i[916,929] [2024-11-18 18:54:29,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:54:29,709 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 18:54:29,722 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_codestructure_steplocals_file-9.i[916,929] [2024-11-18 18:54:29,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:54:29,764 INFO L204 MainTranslator]: Completed translation [2024-11-18 18:54:29,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29 WrapperNode [2024-11-18 18:54:29,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 18:54:29,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 18:54:29,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 18:54:29,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 18:54:29,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,812 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-18 18:54:29,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 18:54:29,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 18:54:29,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 18:54:29,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 18:54:29,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,850 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 18:54:29,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 18:54:29,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 18:54:29,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 18:54:29,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 18:54:29,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (1/1) ... [2024-11-18 18:54:29,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:54:29,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:54:29,915 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 18:54:29,919 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 18:54:29,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 18:54:29,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 18:54:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 18:54:29,955 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 18:54:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 18:54:29,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 18:54:30,020 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 18:54:30,023 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 18:54:30,305 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-18 18:54:30,305 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 18:54:30,316 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 18:54:30,316 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 18:54:30,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:54:30 BoogieIcfgContainer [2024-11-18 18:54:30,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 18:54:30,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 18:54:30,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 18:54:30,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 18:54:30,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:54:29" (1/3) ... [2024-11-18 18:54:30,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb846a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:54:30, skipping insertion in model container [2024-11-18 18:54:30,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:54:29" (2/3) ... [2024-11-18 18:54:30,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb846a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:54:30, skipping insertion in model container [2024-11-18 18:54:30,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:54:30" (3/3) ... [2024-11-18 18:54:30,325 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-9.i [2024-11-18 18:54:30,337 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 18:54:30,337 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 18:54:30,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 18:54:30,404 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;@7bdbddcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 18:54:30,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 18:54:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 18:54:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-18 18:54:30,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:30,419 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:30,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:30,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:30,424 INFO L85 PathProgramCache]: Analyzing trace with hash 207199203, now seen corresponding path program 1 times [2024-11-18 18:54:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:54:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227231174] [2024-11-18 18:54:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:30,437 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 18:54:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:54:30,440 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 18:54:30,441 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 18:54:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:30,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 18:54:30,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:54:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-18 18:54:30,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:54:30,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 18:54:30,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227231174] [2024-11-18 18:54:30,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227231174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:54:30,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:54:30,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 18:54:30,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4955276] [2024-11-18 18:54:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:54:30,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 18:54:30,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 18:54:30,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 18:54:30,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 18:54:30,725 INFO L87 Difference]: Start difference. First operand has 64 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-18 18:54:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:54:30,751 INFO L93 Difference]: Finished difference Result 121 states and 209 transitions. [2024-11-18 18:54:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 18:54:30,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2024-11-18 18:54:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:54:30,758 INFO L225 Difference]: With dead ends: 121 [2024-11-18 18:54:30,758 INFO L226 Difference]: Without dead ends: 60 [2024-11-18 18:54:30,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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 18:54:30,765 INFO L432 NwaCegarLoop]: 89 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, 89 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 18:54:30,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:54:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-18 18:54:30,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-18 18:54:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 18:54:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-18 18:54:30,803 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 133 [2024-11-18 18:54:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:54:30,804 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-18 18:54:30,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-18 18:54:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-18 18:54:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-18 18:54:30,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:54:30,806 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:30,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 18:54:31,007 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 18:54:31,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:54:31,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:54:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1441382090, now seen corresponding path program 1 times [2024-11-18 18:54:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:54:31,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157601052] [2024-11-18 18:54:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:54:31,009 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 18:54:31,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:54:31,011 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 18:54:31,011 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 18:54:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:54:31,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 18:54:31,188 INFO L278 TraceCheckSpWp]: Computing forward predicates...