./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:02:08,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:02:08,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:02:08,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:02:08,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:02:08,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:02:08,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:02:08,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:02:08,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:02:08,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:02:08,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:02:08,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:02:08,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:02:08,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:02:08,918 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:02:08,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:02:08,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:02:08,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:02:08,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:02:08,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:02:08,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:02:08,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:02:08,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:02:08,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:02:08,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:02:08,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:02:08,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:02:08,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:02:08,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:02:08,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:02:08,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:02:08,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:02:08,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:02:08,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:02:08,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:02:08,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:02:08,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:02:08,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:02:08,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:02:08,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:02:08,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:02:08,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:02:08,930 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 [2024-10-11 03:02:09,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:02:09,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:02:09,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:02:09,236 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:02:09,237 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:02:09,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c [2024-10-11 03:02:10,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:02:10,860 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:02:10,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c [2024-10-11 03:02:10,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a2a8396c0/53adfc5262e5439e9df24461795673bc/FLAG68e2cf122 [2024-10-11 03:02:11,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a2a8396c0/53adfc5262e5439e9df24461795673bc [2024-10-11 03:02:11,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:02:11,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:02:11,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:02:11,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:02:11,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:02:11,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593e3eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11, skipping insertion in model container [2024-10-11 03:02:11,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:02:11,434 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c[769,782] [2024-10-11 03:02:11,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:02:11,447 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:02:11,457 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c[769,782] [2024-10-11 03:02:11,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:02:11,474 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:02:11,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11 WrapperNode [2024-10-11 03:02:11,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:02:11,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:02:11,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:02:11,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:02:11,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,508 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-10-11 03:02:11,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:02:11,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:02:11,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:02:11,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:02:11,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,528 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:02:11,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:02:11,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:02:11,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:02:11,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:02:11,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (1/1) ... [2024-10-11 03:02:11,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:02:11,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:11,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:02:11,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:02:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:02:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-10-11 03:02:11,633 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-10-11 03:02:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:02:11,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:02:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:02:11,706 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:02:11,710 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:02:11,814 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 03:02:11,814 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:02:11,844 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:02:11,844 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:02:11,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:02:11 BoogieIcfgContainer [2024-10-11 03:02:11,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:02:11,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:02:11,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:02:11,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:02:11,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:02:11" (1/3) ... [2024-10-11 03:02:11,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9631c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:02:11, skipping insertion in model container [2024-10-11 03:02:11,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:02:11" (2/3) ... [2024-10-11 03:02:11,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9631c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:02:11, skipping insertion in model container [2024-10-11 03:02:11,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:02:11" (3/3) ... [2024-10-11 03:02:11,857 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2024-10-11 03:02:11,889 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:02:11,890 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:02:11,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:02:11,980 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;@4a0fa843, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:02:11,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:02:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 03:02:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 03:02:11,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:11,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:11,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:11,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1546859687, now seen corresponding path program 1 times [2024-10-11 03:02:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154647211] [2024-10-11 03:02:12,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:12,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:12,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:02:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154647211] [2024-10-11 03:02:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154647211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:02:12,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:02:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:02:12,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592579486] [2024-10-11 03:02:12,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:02:12,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:02:12,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:12,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:02:12,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:02:12,433 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:02:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:12,528 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-11 03:02:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:02:12,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 03:02:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:12,537 INFO L225 Difference]: With dead ends: 23 [2024-10-11 03:02:12,537 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 03:02:12,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:02:12,545 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:12,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 32 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:02:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 03:02:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-11 03:02:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 03:02:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-10-11 03:02:12,579 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-10-11 03:02:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:12,579 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-11 03:02:12,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:02:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-10-11 03:02:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 03:02:12,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:12,580 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:12,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:02:12,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:12,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash -797183849, now seen corresponding path program 1 times [2024-10-11 03:02:12,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:12,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118153026] [2024-10-11 03:02:12,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:12,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:02:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118153026] [2024-10-11 03:02:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118153026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:12,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496843056] [2024-10-11 03:02:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:12,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:12,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:12,997 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:12,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:02:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:13,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 03:02:13,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:02:13,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:02:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496843056] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:13,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:13,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2024-10-11 03:02:13,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075796101] [2024-10-11 03:02:13,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:13,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 03:02:13,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:13,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 03:02:13,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:02:13,725 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 03:02:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:13,888 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-11 03:02:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:02:13,889 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 16 [2024-10-11 03:02:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:13,890 INFO L225 Difference]: With dead ends: 27 [2024-10-11 03:02:13,890 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 03:02:13,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:02:13,892 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:13,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 59 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:02:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 03:02:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 03:02:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:02:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-11 03:02:13,900 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-10-11 03:02:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:13,900 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-11 03:02:13,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 03:02:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-11 03:02:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 03:02:13,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:13,902 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:13,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:02:14,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:14,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:14,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1671831511, now seen corresponding path program 2 times [2024-10-11 03:02:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:14,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257276205] [2024-10-11 03:02:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:14,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:14,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:14,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:02:14,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257276205] [2024-10-11 03:02:14,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257276205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506195205] [2024-10-11 03:02:14,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:02:14,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:14,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:14,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:14,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:02:14,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:02:14,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:14,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 03:02:14,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:02:14,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:02:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506195205] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:16,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:16,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 31 [2024-10-11 03:02:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138820414] [2024-10-11 03:02:16,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:16,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 03:02:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 03:02:16,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:02:16,128 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 21 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 03:02:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:16,465 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-10-11 03:02:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:02:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 21 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) Word has length 28 [2024-10-11 03:02:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:16,467 INFO L225 Difference]: With dead ends: 36 [2024-10-11 03:02:16,467 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 03:02:16,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 03:02:16,468 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:16,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 135 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:02:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 03:02:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 03:02:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:02:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-11 03:02:16,483 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2024-10-11 03:02:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:16,483 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-11 03:02:16,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 21 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 03:02:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-11 03:02:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 03:02:16,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:16,486 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:16,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:02:16,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:16,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:16,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1245455975, now seen corresponding path program 3 times [2024-10-11 03:02:16,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:16,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608672046] [2024-10-11 03:02:16,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:16,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:17,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:17,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:17,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-11 03:02:17,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:17,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608672046] [2024-10-11 03:02:17,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608672046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:17,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108349844] [2024-10-11 03:02:17,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:02:17,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:17,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:17,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:17,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:02:17,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-11 03:02:17,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:17,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 03:02:17,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-11 03:02:18,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 03:02:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108349844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:21,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:21,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 24] total 46 [2024-10-11 03:02:21,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180010747] [2024-10-11 03:02:21,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:21,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-11 03:02:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:21,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-11 03:02:21,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1834, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 03:02:21,651 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 30 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) [2024-10-11 03:02:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:22,194 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-10-11 03:02:22,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 03:02:22,194 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 30 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) Word has length 46 [2024-10-11 03:02:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:22,196 INFO L225 Difference]: With dead ends: 54 [2024-10-11 03:02:22,196 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 03:02:22,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=631, Invalid=3925, Unknown=0, NotChecked=0, Total=4556 [2024-10-11 03:02:22,199 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 56 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:22,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 222 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:02:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 03:02:22,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 03:02:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 03:02:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-10-11 03:02:22,213 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2024-10-11 03:02:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:22,214 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-10-11 03:02:22,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 30 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) [2024-10-11 03:02:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-10-11 03:02:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 03:02:22,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:22,219 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:22,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:02:22,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:22,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:22,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash -828786649, now seen corresponding path program 4 times [2024-10-11 03:02:22,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:22,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55613358] [2024-10-11 03:02:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:22,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:22,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-11 03:02:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55613358] [2024-10-11 03:02:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55613358] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751533844] [2024-10-11 03:02:24,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 03:02:24,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:24,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:24,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:24,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:02:24,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 03:02:24,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:24,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-11 03:02:24,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-11 03:02:25,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-11 03:02:47,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751533844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:47,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:47,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 42] total 76 [2024-10-11 03:02:47,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146580795] [2024-10-11 03:02:47,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:47,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-10-11 03:02:47,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:48,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-10-11 03:02:48,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=5134, Unknown=0, NotChecked=0, Total=5700 [2024-10-11 03:02:48,002 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 76 states, 76 states have (on average 1.236842105263158) internal successors, (94), 48 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) [2024-10-11 03:02:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:49,718 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-10-11 03:02:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-11 03:02:49,719 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.236842105263158) internal successors, (94), 48 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) Word has length 82 [2024-10-11 03:02:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:49,720 INFO L225 Difference]: With dead ends: 90 [2024-10-11 03:02:49,720 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 03:02:49,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2953 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1873, Invalid=12889, Unknown=0, NotChecked=0, Total=14762 [2024-10-11 03:02:49,725 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 130 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:49,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 590 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:02:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 03:02:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 03:02:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 57 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (26), 25 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 03:02:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2024-10-11 03:02:49,738 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2024-10-11 03:02:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:49,738 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2024-10-11 03:02:49,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.236842105263158) internal successors, (94), 48 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) [2024-10-11 03:02:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2024-10-11 03:02:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 03:02:49,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:49,741 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:49,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:02:49,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:49,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:49,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:49,942 INFO L85 PathProgramCache]: Analyzing trace with hash 479378343, now seen corresponding path program 5 times [2024-10-11 03:02:49,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:49,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990505645] [2024-10-11 03:02:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:49,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:51,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:52,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:52,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:53,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:53,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:54,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:54,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:55,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:55,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:55,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:56,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:56,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:56,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:56,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:57,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:57,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:57,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:02:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2024-10-11 03:02:57,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:57,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990505645] [2024-10-11 03:02:57,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990505645] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:57,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896490554] [2024-10-11 03:02:57,497 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 03:02:57,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:57,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:57,499 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:57,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:02:57,904 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2024-10-11 03:02:57,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:57,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 03:02:57,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:03:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 876 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2024-10-11 03:03:00,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:03:00,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896490554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:03:00,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:03:00,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [55] total 107 [2024-10-11 03:03:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388556103] [2024-10-11 03:03:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:03:00,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-11 03:03:00,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:03:00,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-11 03:03:00,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=10549, Unknown=0, NotChecked=0, Total=11342 [2024-10-11 03:03:00,624 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 54 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 03:03:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:03:00,752 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2024-10-11 03:03:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-11 03:03:00,753 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) Word has length 154 [2024-10-11 03:03:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:03:00,754 INFO L225 Difference]: With dead ends: 84 [2024-10-11 03:03:00,754 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:03:00,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=793, Invalid=10549, Unknown=0, NotChecked=0, Total=11342 [2024-10-11 03:03:00,758 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:03:00,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:03:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:03:00,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:03:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:03:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:03:00,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2024-10-11 03:03:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:03:00,761 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:03:00,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 03:03:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:03:00,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:03:00,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:03:00,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:03:00,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:03:00,968 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1] [2024-10-11 03:03:00,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:03:01,383 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:03:01,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:03:01 BoogieIcfgContainer [2024-10-11 03:03:01,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:03:01,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:03:01,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:03:01,432 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:03:01,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:02:11" (3/4) ... [2024-10-11 03:03:01,434 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:03:01,438 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hanoi [2024-10-11 03:03:01,441 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 03:03:01,442 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 03:03:01,442 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 03:03:01,443 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:03:01,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:03:01,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:03:01,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:03:01,524 INFO L158 Benchmark]: Toolchain (without parser) took 50292.43ms. Allocated memory was 188.7MB in the beginning and 652.2MB in the end (delta: 463.5MB). Free memory was 158.9MB in the beginning and 480.8MB in the end (delta: -321.9MB). Peak memory consumption was 142.6MB. Max. memory is 16.1GB. [2024-10-11 03:03:01,524 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 115.3MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:03:01,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.62ms. Allocated memory is still 188.7MB. Free memory was 158.9MB in the beginning and 146.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 03:03:01,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.17ms. Allocated memory is still 188.7MB. Free memory was 146.3MB in the beginning and 145.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:03:01,525 INFO L158 Benchmark]: Boogie Preprocessor took 25.22ms. Allocated memory is still 188.7MB. Free memory was 145.1MB in the beginning and 144.2MB in the end (delta: 922.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:03:01,525 INFO L158 Benchmark]: RCFGBuilder took 310.28ms. Allocated memory is still 188.7MB. Free memory was 144.2MB in the beginning and 132.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 03:03:01,526 INFO L158 Benchmark]: TraceAbstraction took 49584.00ms. Allocated memory was 188.7MB in the beginning and 652.2MB in the end (delta: 463.5MB). Free memory was 131.6MB in the beginning and 485.0MB in the end (delta: -353.4MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2024-10-11 03:03:01,526 INFO L158 Benchmark]: Witness Printer took 91.56ms. Allocated memory is still 652.2MB. Free memory was 485.0MB in the beginning and 480.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 03:03:01,528 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.23ms. Allocated memory is still 115.3MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.62ms. Allocated memory is still 188.7MB. Free memory was 158.9MB in the beginning and 146.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.17ms. Allocated memory is still 188.7MB. Free memory was 146.3MB in the beginning and 145.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.22ms. Allocated memory is still 188.7MB. Free memory was 145.1MB in the beginning and 144.2MB in the end (delta: 922.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 310.28ms. Allocated memory is still 188.7MB. Free memory was 144.2MB in the beginning and 132.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49584.00ms. Allocated memory was 188.7MB in the beginning and 652.2MB in the end (delta: 463.5MB). Free memory was 131.6MB in the beginning and 485.0MB in the end (delta: -353.4MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. * Witness Printer took 91.56ms. Allocated memory is still 652.2MB. Free memory was 485.0MB in the beginning and 480.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 35]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.0s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 1333 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1216 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2271 IncrementalHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 117 mSDtfsCounter, 2271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 797 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5023 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=5, InterpolantAutomatonStates: 174, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 43.8s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 819 ConstructedInterpolants, 0 QuantifiedInterpolants, 3457 SizeOfPredicates, 22 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 3280/5280 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 18]: Procedure Contract for hanoi Derived contract for procedure hanoi. Ensures: ((((((((((((((((n <= 13) && (8191 <= \result)) || ((3 <= \result) && (n <= 2))) || ((n <= 11) && (2047 <= \result))) || ((n <= 6) && (63 <= \result))) || ((511 <= \result) && (n <= 9))) || ((n <= 7) && (127 <= \result))) || (33554430 < \result)) || ((n <= 8) && (255 <= \result))) || ((n <= 12) && (4095 <= \result))) || ((\result == 1) && (n == 1))) || ((n <= 5) && (31 <= \result))) || ((1023 <= \result) && (n <= 10))) || ((7 <= \result) && (n <= 3))) || ((16383 <= \result) && (((long long) 8178 + n) <= \result))) || ((15 <= \result) && (n <= 4))) RESULT: Ultimate proved your program to be correct! [2024-10-11 03:03:01,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE