./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_15x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_15x0-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 610248c6c4c4e7168ba971ed5fa38cec025658aa482465da336c99be91c3aa5c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:21:15,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:21:15,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:21:15,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:21:15,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:21:15,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:21:15,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:21:15,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:21:15,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:21:15,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:21:15,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:21:15,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:21:15,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:21:15,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:21:15,542 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:21:15,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:21:15,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:21:15,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:21:15,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:21:15,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:21:15,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:21:15,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:21:15,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:21:15,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:21:15,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:21:15,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:21:15,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:21:15,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:21:15,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:21:15,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:21:15,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:21:15,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:21:15,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:21:15,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:21:15,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:21:15,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:21:15,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:21:15,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:21:15,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:21:15,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:21:15,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:21:15,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:21:15,566 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 610248c6c4c4e7168ba971ed5fa38cec025658aa482465da336c99be91c3aa5c [2024-11-08 15:21:15,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:21:15,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:21:15,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:21:15,850 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:21:15,850 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:21:15,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-11-08 15:21:17,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:21:17,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:21:17,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-11-08 15:21:17,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5daa2e8ea/7ccb03930897410ba45749a778f511aa/FLAG36861907d [2024-11-08 15:21:17,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5daa2e8ea/7ccb03930897410ba45749a778f511aa [2024-11-08 15:21:17,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:21:17,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:21:17,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:21:17,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:21:17,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:21:17,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:21:17" (1/1) ... [2024-11-08 15:21:17,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cffc4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:17, skipping insertion in model container [2024-11-08 15:21:17,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:21:17" (1/1) ... [2024-11-08 15:21:17,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:21:18,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c[481,494] [2024-11-08 15:21:18,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:21:18,098 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:21:18,111 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c[481,494] [2024-11-08 15:21:18,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:21:18,123 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:21:18,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18 WrapperNode [2024-11-08 15:21:18,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:21:18,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:21:18,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:21:18,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:21:18,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,148 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-08 15:21:18,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:21:18,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:21:18,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:21:18,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:21:18,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,166 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:21:18,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:21:18,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:21:18,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:21:18,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:21:18,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (1/1) ... [2024-11-08 15:21:18,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:21:18,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:18,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:21:18,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:21:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:21:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:21:18,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:21:18,238 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-08 15:21:18,239 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-08 15:21:18,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:21:18,300 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:21:18,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:21:18,389 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 15:21:18,389 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:21:18,403 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:21:18,403 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:21:18,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:21:18 BoogieIcfgContainer [2024-11-08 15:21:18,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:21:18,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:21:18,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:21:18,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:21:18,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:21:17" (1/3) ... [2024-11-08 15:21:18,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d8a02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:21:18, skipping insertion in model container [2024-11-08 15:21:18,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:21:18" (2/3) ... [2024-11-08 15:21:18,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d8a02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:21:18, skipping insertion in model container [2024-11-08 15:21:18,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:21:18" (3/3) ... [2024-11-08 15:21:18,417 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2024-11-08 15:21:18,435 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:21:18,435 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:21:18,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:21:18,496 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;@1353e164, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:21:18,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:21:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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-11-08 15:21:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 15:21:18,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:18,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:18,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:18,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2024-11-08 15:21:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:18,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472611743] [2024-11-08 15:21:18,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:18,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:21:18,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472611743] [2024-11-08 15:21:18,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472611743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:21:18,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:21:18,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:21:18,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187989221] [2024-11-08 15:21:18,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:21:18,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:21:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:21:18,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:21:18,885 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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 5 states, 4 states have (on average 2.0) 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-11-08 15:21:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:18,946 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-08 15:21:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:21:18,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-11-08 15:21:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:18,959 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:21:18,959 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 15:21:18,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:21:18,966 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:18,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 15:21:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 15:21:19,004 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-11-08 15:21:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-08 15:21:19,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-08 15:21:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:19,008 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-08 15:21:19,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-11-08 15:21:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-08 15:21:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 15:21:19,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:19,011 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:19,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:21:19,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:19,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2024-11-08 15:21:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:19,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401712801] [2024-11-08 15:21:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:19,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:21:19,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401712801] [2024-11-08 15:21:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401712801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425488266] [2024-11-08 15:21:19,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:19,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:19,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:19,214 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:19,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:21:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:19,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:21:19,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:21:19,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:21:19,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425488266] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:19,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:19,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2024-11-08 15:21:19,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869274646] [2024-11-08 15:21:19,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:19,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 15:21:19,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:19,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 15:21:19,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:21:19,646 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 15:21:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:19,708 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-08 15:21:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:21:19,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2024-11-08 15:21:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:19,709 INFO L225 Difference]: With dead ends: 22 [2024-11-08 15:21:19,710 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 15:21:19,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:21:19,712 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:19,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 15:21:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 15:21:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:21:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-08 15:21:19,720 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2024-11-08 15:21:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:19,720 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-08 15:21:19,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 15:21:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-08 15:21:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:21:19,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:19,722 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:19,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:21:19,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:19,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:19,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2024-11-08 15:21:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:19,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692215436] [2024-11-08 15:21:19,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,188 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:21:20,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:20,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692215436] [2024-11-08 15:21:20,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692215436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:20,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049766313] [2024-11-08 15:21:20,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:21:20,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:20,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:20,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:20,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:21:20,238 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:21:20,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:20,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:21:20,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:21:20,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:21:20,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049766313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:20,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:20,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2024-11-08 15:21:20,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131240626] [2024-11-08 15:21:20,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:20,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:21:20,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:20,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:21:20,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:21:20,630 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-08 15:21:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:20,693 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-08 15:21:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:21:20,693 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2024-11-08 15:21:20,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:20,694 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:21:20,694 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 15:21:20,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:21:20,696 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:20,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 44 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 15:21:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-08 15:21:20,700 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-11-08 15:21:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-08 15:21:20,701 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2024-11-08 15:21:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:20,701 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-08 15:21:20,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-08 15:21:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-08 15:21:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 15:21:20,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:20,702 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:20,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:21:20,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 15:21:20,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:20,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:20,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2024-11-08 15:21:20,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:20,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188865639] [2024-11-08 15:21:20,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:20,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:21:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188865639] [2024-11-08 15:21:21,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188865639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282167229] [2024-11-08 15:21:21,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:21:21,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:21,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:21,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:21,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:21:21,156 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 15:21:21,157 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:21,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:21:21,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:21:21,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:21:21,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282167229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:21,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:21,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2024-11-08 15:21:21,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147468628] [2024-11-08 15:21:21,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:21,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 15:21:21,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:21,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 15:21:21,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:21:21,730 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-08 15:21:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:21,792 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-08 15:21:21,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:21:21,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 28 [2024-11-08 15:21:21,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:21,794 INFO L225 Difference]: With dead ends: 28 [2024-11-08 15:21:21,794 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 15:21:21,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:21:21,795 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:21,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 15:21:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 15:21:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 15:21:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-08 15:21:21,800 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 28 [2024-11-08 15:21:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:21,800 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-08 15:21:21,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-08 15:21:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-08 15:21:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 15:21:21,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:21,802 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:21,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 15:21:22,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:22,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:22,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash 371264716, now seen corresponding path program 4 times [2024-11-08 15:21:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:22,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110164937] [2024-11-08 15:21:22,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 15:21:22,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:22,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110164937] [2024-11-08 15:21:22,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110164937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:22,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806444455] [2024-11-08 15:21:22,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 15:21:22,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:22,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:22,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:22,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:21:22,396 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 15:21:22,397 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:22,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 15:21:22,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 15:21:22,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 15:21:23,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806444455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:23,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:23,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-11-08 15:21:23,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705720162] [2024-11-08 15:21:23,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:23,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:21:23,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:23,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:21:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:21:23,187 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-08 15:21:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:23,274 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-08 15:21:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:21:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) Word has length 34 [2024-11-08 15:21:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:23,276 INFO L225 Difference]: With dead ends: 31 [2024-11-08 15:21:23,276 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 15:21:23,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:21:23,278 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:23,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 60 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:23,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 15:21:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 15:21:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 15:21:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-08 15:21:23,287 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 34 [2024-11-08 15:21:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:23,289 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-08 15:21:23,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-08 15:21:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-08 15:21:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:21:23,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:23,290 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:23,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:21:23,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:23,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:23,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:23,491 INFO L85 PathProgramCache]: Analyzing trace with hash -886339242, now seen corresponding path program 5 times [2024-11-08 15:21:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:23,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840496942] [2024-11-08 15:21:23,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:23,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:23,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 15:21:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840496942] [2024-11-08 15:21:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840496942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534025962] [2024-11-08 15:21:23,790 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 15:21:23,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:23,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:23,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:23,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:21:23,855 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-08 15:21:23,855 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:23,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 15:21:23,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 15:21:23,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:21:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534025962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:24,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2024-11-08 15:21:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666183536] [2024-11-08 15:21:24,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:24,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 15:21:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:24,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 15:21:24,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:21:24,983 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-08 15:21:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:25,068 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-08 15:21:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:21:25,068 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) Word has length 40 [2024-11-08 15:21:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:25,069 INFO L225 Difference]: With dead ends: 34 [2024-11-08 15:21:25,069 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 15:21:25,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:21:25,070 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:25,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 82 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 15:21:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-08 15:21:25,077 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-11-08 15:21:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-08 15:21:25,078 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 40 [2024-11-08 15:21:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:25,080 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-08 15:21:25,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-08 15:21:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-08 15:21:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 15:21:25,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:25,081 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:25,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 15:21:25,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:25,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:25,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:25,283 INFO L85 PathProgramCache]: Analyzing trace with hash -918712436, now seen corresponding path program 6 times [2024-11-08 15:21:25,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:25,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395356668] [2024-11-08 15:21:25,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:25,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:25,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:25,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:25,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:25,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:25,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-08 15:21:25,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:25,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395356668] [2024-11-08 15:21:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395356668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:25,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763062769] [2024-11-08 15:21:25,645 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 15:21:25,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:25,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:25,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:25,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 15:21:25,728 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-08 15:21:25,728 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:25,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:21:25,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-08 15:21:25,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 15:21:27,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763062769] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:27,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:27,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2024-11-08 15:21:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510702223] [2024-11-08 15:21:27,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:27,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 15:21:27,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:27,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 15:21:27,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:21:27,216 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-08 15:21:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:27,302 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-08 15:21:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:21:27,303 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) Word has length 46 [2024-11-08 15:21:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:27,304 INFO L225 Difference]: With dead ends: 37 [2024-11-08 15:21:27,304 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 15:21:27,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2024-11-08 15:21:27,305 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:27,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 69 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 15:21:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 15:21:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 15:21:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-08 15:21:27,324 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 46 [2024-11-08 15:21:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:27,324 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-08 15:21:27,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-08 15:21:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-08 15:21:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:21:27,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:27,325 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:27,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 15:21:27,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:27,529 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:27,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:27,529 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 7 times [2024-11-08 15:21:27,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:27,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563680801] [2024-11-08 15:21:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-08 15:21:27,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:27,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563680801] [2024-11-08 15:21:27,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563680801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:27,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418508459] [2024-11-08 15:21:27,924 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 15:21:27,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:27,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:27,926 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:27,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 15:21:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:28,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:21:28,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-08 15:21:28,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 15:21:29,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418508459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:29,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:29,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2024-11-08 15:21:29,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524427617] [2024-11-08 15:21:29,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:29,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 15:21:29,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:29,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 15:21:29,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:21:29,869 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-08 15:21:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:29,957 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-08 15:21:29,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:21:29,957 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2024-11-08 15:21:29,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:29,958 INFO L225 Difference]: With dead ends: 40 [2024-11-08 15:21:29,958 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 15:21:29,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2024-11-08 15:21:29,962 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:29,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 82 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 15:21:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 15:21:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 15:21:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-08 15:21:29,968 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2024-11-08 15:21:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:29,968 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-08 15:21:29,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-08 15:21:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-08 15:21:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 15:21:29,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:29,970 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:29,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 15:21:30,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:30,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:30,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 8 times [2024-11-08 15:21:30,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:30,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331782550] [2024-11-08 15:21:30,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:30,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:30,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:30,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:30,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 15:21:30,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331782550] [2024-11-08 15:21:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331782550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327347610] [2024-11-08 15:21:30,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:21:30,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:30,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:30,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:30,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 15:21:30,811 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:21:30,811 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:30,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 15:21:30,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 15:21:30,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 15:21:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327347610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:33,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2024-11-08 15:21:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851453695] [2024-11-08 15:21:33,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:33,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 15:21:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:33,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 15:21:33,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:21:33,357 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-08 15:21:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:33,472 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-11-08 15:21:33,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 15:21:33,472 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 58 [2024-11-08 15:21:33,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:33,474 INFO L225 Difference]: With dead ends: 43 [2024-11-08 15:21:33,476 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 15:21:33,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 113 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:21:33,477 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:33,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 81 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:21:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 15:21:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 15:21:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-08 15:21:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-08 15:21:33,487 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 58 [2024-11-08 15:21:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:33,487 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-08 15:21:33,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-08 15:21:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-08 15:21:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 15:21:33,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:33,491 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:33,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 15:21:33,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 15:21:33,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:33,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -366706730, now seen corresponding path program 9 times [2024-11-08 15:21:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003437317] [2024-11-08 15:21:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:33,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:34,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:34,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:34,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:34,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:34,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:34,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-08 15:21:34,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003437317] [2024-11-08 15:21:34,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003437317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459516492] [2024-11-08 15:21:34,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:21:34,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:34,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:34,291 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:34,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 15:21:34,454 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-08 15:21:34,454 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:34,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 15:21:34,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-08 15:21:34,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-08 15:21:37,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459516492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:37,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:37,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 26 [2024-11-08 15:21:37,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766349680] [2024-11-08 15:21:37,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:37,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 15:21:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:37,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 15:21:37,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2024-11-08 15:21:37,888 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2024-11-08 15:21:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:37,990 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-11-08 15:21:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:21:37,991 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) Word has length 64 [2024-11-08 15:21:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:37,991 INFO L225 Difference]: With dead ends: 46 [2024-11-08 15:21:37,991 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 15:21:37,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 125 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=812, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 15:21:37,993 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:37,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 91 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:21:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 15:21:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 15:21:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 15:21:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-11-08 15:21:37,998 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 64 [2024-11-08 15:21:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:37,999 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-11-08 15:21:37,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2024-11-08 15:21:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-11-08 15:21:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 15:21:38,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:38,000 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:38,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 15:21:38,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 15:21:38,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1719425780, now seen corresponding path program 10 times [2024-11-08 15:21:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:38,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609169052] [2024-11-08 15:21:38,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-08 15:21:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609169052] [2024-11-08 15:21:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609169052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564389497] [2024-11-08 15:21:38,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 15:21:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:38,873 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:38,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 15:21:39,080 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 15:21:39,080 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:39,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 15:21:39,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-08 15:21:39,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-08 15:21:43,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564389497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:43,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:43,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 28 [2024-11-08 15:21:43,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991932007] [2024-11-08 15:21:43,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:43,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 15:21:43,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:43,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 15:21:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2024-11-08 15:21:43,670 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2024-11-08 15:21:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:43,813 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-11-08 15:21:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:21:43,814 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) Word has length 70 [2024-11-08 15:21:43,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:43,816 INFO L225 Difference]: With dead ends: 49 [2024-11-08 15:21:43,816 INFO L226 Difference]: Without dead ends: 45 [2024-11-08 15:21:43,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 137 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=448, Invalid=958, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 15:21:43,817 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:43,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 107 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:21:43,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-08 15:21:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-08 15:21:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:21:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-11-08 15:21:43,823 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 70 [2024-11-08 15:21:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:43,823 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-08 15:21:43,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2024-11-08 15:21:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-11-08 15:21:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 15:21:43,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:43,828 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:43,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 15:21:44,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 15:21:44,029 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:44,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1354232598, now seen corresponding path program 11 times [2024-11-08 15:21:44,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:44,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841477220] [2024-11-08 15:21:44,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:44,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-08 15:21:44,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841477220] [2024-11-08 15:21:44,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841477220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212919257] [2024-11-08 15:21:44,779 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 15:21:44,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:44,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:44,781 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:44,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 15:21:45,070 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-08 15:21:45,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:45,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 15:21:45,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-08 15:21:45,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-08 15:21:50,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212919257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:50,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:50,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 30 [2024-11-08 15:21:50,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935628465] [2024-11-08 15:21:50,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:50,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 15:21:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 15:21:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2024-11-08 15:21:50,863 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2024-11-08 15:21:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:51,014 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2024-11-08 15:21:51,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 15:21:51,015 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) Word has length 76 [2024-11-08 15:21:51,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:51,016 INFO L225 Difference]: With dead ends: 52 [2024-11-08 15:21:51,016 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 15:21:51,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 149 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 15:21:51,017 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:51,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 105 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:21:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 15:21:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 15:21:51,022 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-11-08 15:21:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-11-08 15:21:51,023 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 76 [2024-11-08 15:21:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:51,023 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-11-08 15:21:51,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2024-11-08 15:21:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-11-08 15:21:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 15:21:51,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:51,025 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:21:51,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 15:21:51,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 15:21:51,230 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:21:51,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:21:51,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1734686668, now seen corresponding path program 12 times [2024-11-08 15:21:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:21:51,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962144805] [2024-11-08 15:21:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:21:51,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:21:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:52,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:52,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:21:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:21:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-08 15:21:52,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:21:52,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962144805] [2024-11-08 15:21:52,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962144805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:21:52,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695285223] [2024-11-08 15:21:52,063 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 15:21:52,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:21:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:21:52,065 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:21:52,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 15:21:52,459 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-11-08 15:21:52,459 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:21:52,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 15:21:52,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:21:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-08 15:21:52,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:21:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 15:21:59,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695285223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:21:59,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:21:59,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 32 [2024-11-08 15:21:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285249581] [2024-11-08 15:21:59,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:21:59,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 15:21:59,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:21:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 15:21:59,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:21:59,816 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-08 15:21:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:21:59,978 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2024-11-08 15:21:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 15:21:59,979 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) Word has length 82 [2024-11-08 15:21:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:21:59,979 INFO L225 Difference]: With dead ends: 55 [2024-11-08 15:21:59,979 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 15:21:59,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 161 SyntacticMatches, 13 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=606, Invalid=1286, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 15:21:59,981 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:21:59,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 104 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:21:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 15:21:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 15:21:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 15:21:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-11-08 15:21:59,986 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 82 [2024-11-08 15:21:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:21:59,986 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-08 15:21:59,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-08 15:21:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2024-11-08 15:21:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 15:21:59,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:21:59,987 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:00,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 15:22:00,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 15:22:00,192 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:22:00,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1433749930, now seen corresponding path program 13 times [2024-11-08 15:22:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:00,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079132632] [2024-11-08 15:22:00,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:00,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:00,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-08 15:22:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:22:01,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079132632] [2024-11-08 15:22:01,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079132632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:22:01,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005022054] [2024-11-08 15:22:01,077 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 15:22:01,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:22:01,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:22:01,079 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:22:01,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 15:22:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:01,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 15:22:01,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:22:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-08 15:22:01,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:22:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 15:22:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005022054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:22:10,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:22:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 34 [2024-11-08 15:22:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416568355] [2024-11-08 15:22:10,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:22:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 15:22:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 15:22:10,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 15:22:10,900 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2024-11-08 15:22:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:11,076 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2024-11-08 15:22:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 15:22:11,076 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) Word has length 88 [2024-11-08 15:22:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:11,077 INFO L225 Difference]: With dead ends: 58 [2024-11-08 15:22:11,077 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 15:22:11,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 173 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=694, Invalid=1468, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 15:22:11,079 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 165 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:22:11,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 114 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:22:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 15:22:11,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 15:22:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 15:22:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2024-11-08 15:22:11,084 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 88 [2024-11-08 15:22:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:11,084 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2024-11-08 15:22:11,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2024-11-08 15:22:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2024-11-08 15:22:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 15:22:11,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:11,085 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:11,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 15:22:11,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 15:22:11,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:22:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1321174388, now seen corresponding path program 14 times [2024-11-08 15:22:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:11,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667221409] [2024-11-08 15:22:11,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:11,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:11,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:11,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:11,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:12,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:12,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:12,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:12,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:12,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-08 15:22:12,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:22:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667221409] [2024-11-08 15:22:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667221409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:22:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242321038] [2024-11-08 15:22:12,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:22:12,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:22:12,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:22:12,380 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:22:12,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 15:22:12,913 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:22:12,913 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:22:12,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 15:22:12,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:22:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-08 15:22:12,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:22:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-08 15:22:24,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242321038] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:22:24,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:22:24,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2024-11-08 15:22:24,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843853690] [2024-11-08 15:22:24,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:22:24,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 15:22:24,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 15:22:24,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 15:22:24,308 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-11-08 15:22:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:24,502 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2024-11-08 15:22:24,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 15:22:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) Word has length 94 [2024-11-08 15:22:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:24,503 INFO L225 Difference]: With dead ends: 61 [2024-11-08 15:22:24,503 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 15:22:24,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 185 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=785, Invalid=1567, Unknown=0, NotChecked=0, Total=2352 [2024-11-08 15:22:24,504 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:22:24,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 121 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:22:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 15:22:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-08 15:22:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 15:22:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-08 15:22:24,510 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 94 [2024-11-08 15:22:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:24,510 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-08 15:22:24,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-11-08 15:22:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-08 15:22:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:22:24,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:24,512 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:24,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 15:22:24,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:22:24,712 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:22:24,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 15 times [2024-11-08 15:22:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:24,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918923569] [2024-11-08 15:22:24,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:24,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:22:24,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:22:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:22:24,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:22:24,788 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:22:24,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:22:24,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:22:24,795 INFO L407 BasicCegarLoop]: Path program histogram: [15, 1] [2024-11-08 15:22:24,849 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:22:24,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:22:24 BoogieIcfgContainer [2024-11-08 15:22:24,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:22:24,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:22:24,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:22:24,853 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:22:24,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:21:18" (3/4) ... [2024-11-08 15:22:24,855 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:22:24,920 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:22:24,920 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:22:24,921 INFO L158 Benchmark]: Toolchain (without parser) took 67029.49ms. Allocated memory was 180.4MB in the beginning and 677.4MB in the end (delta: 497.0MB). Free memory was 132.1MB in the beginning and 339.4MB in the end (delta: -207.3MB). Peak memory consumption was 291.5MB. Max. memory is 16.1GB. [2024-11-08 15:22:24,921 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 180.4MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:22:24,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.01ms. Allocated memory is still 180.4MB. Free memory was 132.1MB in the beginning and 120.3MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 15:22:24,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.42ms. Allocated memory is still 180.4MB. Free memory was 120.3MB in the beginning and 118.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:22:24,921 INFO L158 Benchmark]: Boogie Preprocessor took 22.64ms. Allocated memory is still 180.4MB. Free memory was 118.7MB in the beginning and 117.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:22:24,922 INFO L158 Benchmark]: RCFGBuilder took 231.86ms. Allocated memory is still 180.4MB. Free memory was 117.4MB in the beginning and 106.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 15:22:24,922 INFO L158 Benchmark]: TraceAbstraction took 66442.58ms. Allocated memory was 180.4MB in the beginning and 677.4MB in the end (delta: 497.0MB). Free memory was 106.2MB in the beginning and 342.6MB in the end (delta: -236.4MB). Peak memory consumption was 262.1MB. Max. memory is 16.1GB. [2024-11-08 15:22:24,922 INFO L158 Benchmark]: Witness Printer took 68.28ms. Allocated memory is still 677.4MB. Free memory was 342.6MB in the beginning and 339.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:22:24,924 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.21ms. Allocated memory is still 180.4MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.01ms. Allocated memory is still 180.4MB. Free memory was 132.1MB in the beginning and 120.3MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.42ms. Allocated memory is still 180.4MB. Free memory was 120.3MB in the beginning and 118.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.64ms. Allocated memory is still 180.4MB. Free memory was 118.7MB in the beginning and 117.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 231.86ms. Allocated memory is still 180.4MB. Free memory was 117.4MB in the beginning and 106.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 66442.58ms. Allocated memory was 180.4MB in the beginning and 677.4MB in the end (delta: 497.0MB). Free memory was 106.2MB in the beginning and 342.6MB in the end (delta: -236.4MB). Peak memory consumption was 262.1MB. Max. memory is 16.1GB. * Witness Printer took 68.28ms. Allocated memory is still 677.4MB. Free memory was 342.6MB in the beginning and 339.4MB in the end (delta: 3.1MB). 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 15; [L15] int b = 0; VAL [a=15, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=15, b=0] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.3s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 973 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 823 mSDsluCounter, 1183 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1031 mSDsCounter, 329 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1080 IncrementalHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 329 mSolverCounterUnsat, 152 mSDtfsCounter, 1080 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2022 GetRequests, 1501 SyntacticMatches, 120 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5366 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=15, InterpolantAutomatonStates: 180, 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, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 58.4s InterpolantComputationTime, 1650 NumberOfCodeBlocks, 1650 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 2277 ConstructedInterpolants, 0 QuantifiedInterpolants, 6667 SizeOfPredicates, 105 NumberOfNonLiveVariables, 2562 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 3710/9450 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 15:22:24,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE