./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:46:58,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:46:58,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:46:58,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:46:58,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:46:58,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:46:58,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:46:58,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:46:58,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:46:58,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:46:58,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:46:58,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:46:58,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:46:58,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:46:58,154 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:46:58,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:46:58,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:46:58,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:46:58,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:46:58,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:46:58,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:46:58,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:46:58,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:46:58,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:46:58,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:46:58,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:46:58,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:46:58,161 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:46:58,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:46:58,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:46:58,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:46:58,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:46:58,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:46:58,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:46:58,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:46:58,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:46:58,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:46:58,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:46:58,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:46:58,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:46:58,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:46:58,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:46:58,165 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-10-12 19:46:58,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:46:58,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:46:58,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:46:58,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:46:58,476 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:46:58,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-10-12 19:46:59,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:47:00,063 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:47:00,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-10-12 19:47:00,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c51a2e4d/5b17351ff5ee474a8c4fbb327ae9ce76/FLAGa8b9519d7 [2024-10-12 19:47:00,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c51a2e4d/5b17351ff5ee474a8c4fbb327ae9ce76 [2024-10-12 19:47:00,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:47:00,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:47:00,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:47:00,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:47:00,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:47:00,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c9b699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00, skipping insertion in model container [2024-10-12 19:47:00,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:47:00,315 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c[481,494] [2024-10-12 19:47:00,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:47:00,329 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:47:00,356 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c[481,494] [2024-10-12 19:47:00,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:47:00,372 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:47:00,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00 WrapperNode [2024-10-12 19:47:00,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:47:00,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:47:00,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:47:00,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:47:00,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,401 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-10-12 19:47:00,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:47:00,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:47:00,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:47:00,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:47:00,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,422 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:47:00,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:47:00,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:47:00,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:47:00,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:47:00,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (1/1) ... [2024-10-12 19:47:00,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:47:00,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:00,470 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-10-12 19:47:00,473 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-10-12 19:47:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:47:00,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:47:00,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:47:00,520 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-10-12 19:47:00,520 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-10-12 19:47:00,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:47:00,583 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:47:00,585 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:47:00,687 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-12 19:47:00,687 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:47:00,713 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:47:00,714 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 19:47:00,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:47:00 BoogieIcfgContainer [2024-10-12 19:47:00,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:47:00,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:47:00,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:47:00,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:47:00,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:47:00" (1/3) ... [2024-10-12 19:47:00,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21266fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:47:00, skipping insertion in model container [2024-10-12 19:47:00,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:47:00" (2/3) ... [2024-10-12 19:47:00,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21266fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:47:00, skipping insertion in model container [2024-10-12 19:47:00,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:47:00" (3/3) ... [2024-10-12 19:47:00,735 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2024-10-12 19:47:00,774 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:47:00,775 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:47:00,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:47:00,855 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;@75c6c288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:47:00,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:47:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:47:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 19:47:00,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:00,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:00,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:00,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2024-10-12 19:47:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:00,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681123158] [2024-10-12 19:47:00,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:00,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:47:01,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:01,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681123158] [2024-10-12 19:47:01,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681123158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:47:01,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:47:01,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:47:01,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223179558] [2024-10-12 19:47:01,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:47:01,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:47:01,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:01,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:47:01,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:47:01,184 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:47:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:01,262 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-10-12 19:47:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:47:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2024-10-12 19:47:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:01,275 INFO L225 Difference]: With dead ends: 22 [2024-10-12 19:47:01,276 INFO L226 Difference]: Without dead ends: 14 [2024-10-12 19:47:01,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-12 19:47:01,283 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:01,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:47:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-12 19:47:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-12 19:47:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:47:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-12 19:47:01,319 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2024-10-12 19:47:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:01,319 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-12 19:47:01,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:47:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-12 19:47:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 19:47:01,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:01,320 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:01,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:47:01,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:01,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2024-10-12 19:47:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:01,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393791392] [2024-10-12 19:47:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:01,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:47:01,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393791392] [2024-10-12 19:47:01,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393791392] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:01,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995425125] [2024-10-12 19:47:01,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:01,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:01,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:01,544 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-10-12 19:47:01,547 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-10-12 19:47:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:01,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:47:01,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:47:01,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:47:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995425125] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:01,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:01,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2024-10-12 19:47:01,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223791096] [2024-10-12 19:47:01,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:01,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:47:01,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:01,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:47:01,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:47:01,926 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 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-10-12 19:47:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:01,995 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-10-12 19:47:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:47:01,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 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 15 [2024-10-12 19:47:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:01,997 INFO L225 Difference]: With dead ends: 21 [2024-10-12 19:47:01,997 INFO L226 Difference]: Without dead ends: 17 [2024-10-12 19:47:01,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-10-12 19:47:01,999 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:01,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:47:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-12 19:47:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-12 19:47:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 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-10-12 19:47:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-10-12 19:47:02,005 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2024-10-12 19:47:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:02,005 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-12 19:47:02,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 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-10-12 19:47:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-10-12 19:47:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 19:47:02,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:02,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:02,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 19:47:02,212 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-10-12 19:47:02,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:02,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2024-10-12 19:47:02,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:02,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779583883] [2024-10-12 19:47:02,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:02,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:02,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 19:47:02,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779583883] [2024-10-12 19:47:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779583883] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276433669] [2024-10-12 19:47:02,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:47:02,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:02,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:02,463 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-10-12 19:47:02,465 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-10-12 19:47:02,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:47:02,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:02,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:47:02,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 19:47:02,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 19:47:02,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276433669] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:02,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:02,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2024-10-12 19:47:02,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129626336] [2024-10-12 19:47:02,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:02,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:47:02,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:02,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:47:02,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:47:02,916 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 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-10-12 19:47:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:02,986 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-10-12 19:47:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:47:02,986 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 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 21 [2024-10-12 19:47:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:02,987 INFO L225 Difference]: With dead ends: 24 [2024-10-12 19:47:02,987 INFO L226 Difference]: Without dead ends: 20 [2024-10-12 19:47:02,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 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-10-12 19:47:02,990 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:02,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:47:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-12 19:47:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-12 19:47:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:47:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-12 19:47:02,998 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2024-10-12 19:47:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:02,998 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-12 19:47:02,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 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-10-12 19:47:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-12 19:47:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 19:47:03,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:03,001 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:03,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:47:03,204 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-10-12 19:47:03,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2024-10-12 19:47:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:03,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781337499] [2024-10-12 19:47:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:03,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:03,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:03,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:03,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:03,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 19:47:03,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:03,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781337499] [2024-10-12 19:47:03,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781337499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:03,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802101599] [2024-10-12 19:47:03,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 19:47:03,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:03,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:03,443 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-10-12 19:47:03,445 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-10-12 19:47:03,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-12 19:47:03,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:03,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 19:47:03,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 19:47:03,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:04,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:47:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802101599] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:04,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:04,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2024-10-12 19:47:04,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213098095] [2024-10-12 19:47:04,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:04,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 19:47:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:04,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 19:47:04,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:47:04,074 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 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-10-12 19:47:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:04,162 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-10-12 19:47:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:47:04,162 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 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 27 [2024-10-12 19:47:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:04,163 INFO L225 Difference]: With dead ends: 27 [2024-10-12 19:47:04,163 INFO L226 Difference]: Without dead ends: 23 [2024-10-12 19:47:04,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 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-10-12 19:47:04,164 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:04,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 44 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:47:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-12 19:47:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-12 19:47:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 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-10-12 19:47:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-12 19:47:04,175 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2024-10-12 19:47:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:04,175 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-12 19:47:04,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 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-10-12 19:47:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-12 19:47:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 19:47:04,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:04,178 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:04,190 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-10-12 19:47:04,378 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-10-12 19:47:04,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:04,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2024-10-12 19:47:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:04,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869337173] [2024-10-12 19:47:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:04,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:04,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:04,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:04,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:04,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:47:04,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869337173] [2024-10-12 19:47:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869337173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106431642] [2024-10-12 19:47:04,600 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 19:47:04,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:04,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:04,603 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-10-12 19:47:04,604 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-10-12 19:47:04,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 19:47:04,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:04,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 19:47:04,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:47:04,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:47:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106431642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:05,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-10-12 19:47:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053779962] [2024-10-12 19:47:05,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:05,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 19:47:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:05,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 19:47:05,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:47:05,475 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 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-10-12 19:47:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:05,554 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-12 19:47:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:47:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 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 33 [2024-10-12 19:47:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:05,556 INFO L225 Difference]: With dead ends: 30 [2024-10-12 19:47:05,556 INFO L226 Difference]: Without dead ends: 26 [2024-10-12 19:47:05,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 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-10-12 19:47:05,557 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:05,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 45 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:47:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-12 19:47:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-12 19:47:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 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-10-12 19:47:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-12 19:47:05,563 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2024-10-12 19:47:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:05,564 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-12 19:47:05,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 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-10-12 19:47:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-12 19:47:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 19:47:05,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:05,565 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:05,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 19:47:05,766 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-10-12 19:47:05,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:05,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:05,767 INFO L85 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2024-10-12 19:47:05,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:05,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511927747] [2024-10-12 19:47:05,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:05,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:05,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:06,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:06,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 19:47:06,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:06,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511927747] [2024-10-12 19:47:06,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511927747] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:06,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784707862] [2024-10-12 19:47:06,071 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 19:47:06,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:06,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:06,073 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-10-12 19:47:06,076 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-10-12 19:47:06,140 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-12 19:47:06,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:06,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 19:47:06,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 19:47:06,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 19:47:07,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784707862] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:07,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:07,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2024-10-12 19:47:07,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233102798] [2024-10-12 19:47:07,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:07,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 19:47:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 19:47:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:47:07,347 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 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-10-12 19:47:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:07,424 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-10-12 19:47:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:47:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 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 39 [2024-10-12 19:47:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:07,426 INFO L225 Difference]: With dead ends: 33 [2024-10-12 19:47:07,426 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 19:47:07,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 74 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-10-12 19:47:07,427 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:07,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 45 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:47:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 19:47:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-12 19:47:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:47:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-10-12 19:47:07,433 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2024-10-12 19:47:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:07,433 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-10-12 19:47:07,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 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-10-12 19:47:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-10-12 19:47:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 19:47:07,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:07,435 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:07,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 19:47:07,638 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-10-12 19:47:07,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:07,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2024-10-12 19:47:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020897589] [2024-10-12 19:47:07,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:07,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:07,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:07,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:07,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:07,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-12 19:47:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:07,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020897589] [2024-10-12 19:47:07,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020897589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:07,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115455833] [2024-10-12 19:47:07,983 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 19:47:07,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:07,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:07,985 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-10-12 19:47:07,987 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-10-12 19:47:08,063 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-12 19:47:08,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:08,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 19:47:08,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-12 19:47:08,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 19:47:09,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115455833] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:09,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:09,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2024-10-12 19:47:09,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418415165] [2024-10-12 19:47:09,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:09,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 19:47:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:09,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 19:47:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:47:09,512 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 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-10-12 19:47:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:09,612 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-12 19:47:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:47:09,613 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 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 45 [2024-10-12 19:47:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:09,614 INFO L225 Difference]: With dead ends: 36 [2024-10-12 19:47:09,614 INFO L226 Difference]: Without dead ends: 32 [2024-10-12 19:47:09,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 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-10-12 19:47:09,615 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:09,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 54 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:47:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-12 19:47:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-12 19:47:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 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-10-12 19:47:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-10-12 19:47:09,621 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2024-10-12 19:47:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:09,621 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-10-12 19:47:09,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 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-10-12 19:47:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-10-12 19:47:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 19:47:09,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:09,623 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:09,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 19:47:09,825 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-10-12 19:47:09,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:09,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2024-10-12 19:47:09,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:09,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184078264] [2024-10-12 19:47:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:09,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:09,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:10,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:10,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:10,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:10,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-12 19:47:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184078264] [2024-10-12 19:47:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184078264] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346093186] [2024-10-12 19:47:10,192 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-12 19:47:10,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:10,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:10,194 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-10-12 19:47:10,196 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-10-12 19:47:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:10,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 19:47:10,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-12 19:47:10,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:47:12,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346093186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:12,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:12,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2024-10-12 19:47:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495441423] [2024-10-12 19:47:12,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:12,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 19:47:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:12,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 19:47:12,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:47:12,266 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 22 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 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-10-12 19:47:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:12,372 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-10-12 19:47:12,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:47:12,373 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 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 51 [2024-10-12 19:47:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:12,373 INFO L225 Difference]: With dead ends: 39 [2024-10-12 19:47:12,373 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 19:47:12,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 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-10-12 19:47:12,378 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:12,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 51 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:47:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 19:47:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-12 19:47:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 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-10-12 19:47:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-10-12 19:47:12,383 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2024-10-12 19:47:12,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:12,384 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-10-12 19:47:12,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 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-10-12 19:47:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-10-12 19:47:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:47:12,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:12,385 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:12,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-12 19:47:12,585 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-10-12 19:47:12,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:12,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:12,586 INFO L85 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2024-10-12 19:47:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:12,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866469145] [2024-10-12 19:47:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:12,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:12,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:12,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:12,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:12,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:13,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 19:47:13,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:13,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866469145] [2024-10-12 19:47:13,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866469145] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:13,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934794367] [2024-10-12 19:47:13,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:47:13,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:13,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:13,063 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-10-12 19:47:13,064 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-10-12 19:47:13,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:47:13,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:13,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 19:47:13,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 19:47:13,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 19:47:15,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934794367] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:15,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:15,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2024-10-12 19:47:15,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859202661] [2024-10-12 19:47:15,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:15,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-12 19:47:15,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 19:47:15,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2024-10-12 19:47:15,714 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 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-10-12 19:47:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:15,846 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-10-12 19:47:15,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:47:15,847 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 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 57 [2024-10-12 19:47:15,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:15,847 INFO L225 Difference]: With dead ends: 42 [2024-10-12 19:47:15,848 INFO L226 Difference]: Without dead ends: 38 [2024-10-12 19:47:15,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2024-10-12 19:47:15,849 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:15,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 56 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:47:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-12 19:47:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-12 19:47:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 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-10-12 19:47:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-10-12 19:47:15,862 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2024-10-12 19:47:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:15,862 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-10-12 19:47:15,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 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-10-12 19:47:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-10-12 19:47:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 19:47:15,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:15,864 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:15,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 19:47:16,064 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-10-12 19:47:16,065 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2024-10-12 19:47:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:16,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021263781] [2024-10-12 19:47:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-12 19:47:16,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:16,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021263781] [2024-10-12 19:47:16,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021263781] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:16,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054902240] [2024-10-12 19:47:16,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 19:47:16,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:16,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:16,621 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-10-12 19:47:16,623 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-10-12 19:47:16,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-12 19:47:16,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:16,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 19:47:16,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-12 19:47:16,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-12 19:47:20,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054902240] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:20,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:20,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 26 [2024-10-12 19:47:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187816957] [2024-10-12 19:47:20,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:20,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 19:47:20,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:20,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 19:47:20,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2024-10-12 19:47:20,131 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 26 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 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-10-12 19:47:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:20,264 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-10-12 19:47:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:47:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 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 63 [2024-10-12 19:47:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:20,265 INFO L225 Difference]: With dead ends: 45 [2024-10-12 19:47:20,265 INFO L226 Difference]: Without dead ends: 41 [2024-10-12 19:47:20,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 122 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-10-12 19:47:20,266 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 93 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:20,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 64 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:47:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-12 19:47:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-12 19:47:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 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-10-12 19:47:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-10-12 19:47:20,271 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2024-10-12 19:47:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:20,272 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-10-12 19:47:20,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 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-10-12 19:47:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-10-12 19:47:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 19:47:20,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:20,273 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:20,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-12 19:47:20,477 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-10-12 19:47:20,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:20,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2024-10-12 19:47:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:20,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715918373] [2024-10-12 19:47:20,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:20,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:20,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:20,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:20,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:20,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:20,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:20,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:21,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:21,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-12 19:47:21,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:21,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715918373] [2024-10-12 19:47:21,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715918373] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:21,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170834970] [2024-10-12 19:47:21,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 19:47:21,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:21,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:21,089 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-10-12 19:47:21,091 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-10-12 19:47:21,304 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 19:47:21,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:21,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 19:47:21,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-12 19:47:21,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-12 19:47:26,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170834970] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:26,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:26,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 28 [2024-10-12 19:47:26,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058484444] [2024-10-12 19:47:26,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:26,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-12 19:47:26,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:26,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 19:47:26,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2024-10-12 19:47:26,055 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 28 states, 26 states have (on average 2.076923076923077) internal successors, (54), 27 states have internal predecessors, (54), 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-10-12 19:47:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:26,203 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-10-12 19:47:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:47:26,203 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.076923076923077) internal successors, (54), 27 states have internal predecessors, (54), 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 69 [2024-10-12 19:47:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:26,204 INFO L225 Difference]: With dead ends: 48 [2024-10-12 19:47:26,204 INFO L226 Difference]: Without dead ends: 44 [2024-10-12 19:47:26,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 134 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-10-12 19:47:26,205 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 109 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:26,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 68 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:47:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-12 19:47:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-12 19:47:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 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-10-12 19:47:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2024-10-12 19:47:26,211 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2024-10-12 19:47:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:26,212 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2024-10-12 19:47:26,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.076923076923077) internal successors, (54), 27 states have internal predecessors, (54), 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-10-12 19:47:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2024-10-12 19:47:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 19:47:26,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:26,213 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:26,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-12 19:47:26,413 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-10-12 19:47:26,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash -776930930, now seen corresponding path program 11 times [2024-10-12 19:47:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:26,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245611559] [2024-10-12 19:47:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:26,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:26,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:26,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:26,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:26,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:27,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:27,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:27,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-12 19:47:27,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:27,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245611559] [2024-10-12 19:47:27,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245611559] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:27,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558848720] [2024-10-12 19:47:27,131 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 19:47:27,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:27,133 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-10-12 19:47:27,135 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-10-12 19:47:27,410 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-12 19:47:27,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:27,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 19:47:27,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-12 19:47:27,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 19:47:33,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558848720] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:33,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:33,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 30 [2024-10-12 19:47:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517433851] [2024-10-12 19:47:33,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:33,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-12 19:47:33,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:33,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 19:47:33,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2024-10-12 19:47:33,086 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 30 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 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-10-12 19:47:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:33,223 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2024-10-12 19:47:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:47:33,223 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 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 75 [2024-10-12 19:47:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:33,224 INFO L225 Difference]: With dead ends: 51 [2024-10-12 19:47:33,224 INFO L226 Difference]: Without dead ends: 47 [2024-10-12 19:47:33,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 146 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-10-12 19:47:33,225 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:33,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 72 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:47:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-12 19:47:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-12 19:47:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:47:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-10-12 19:47:33,230 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2024-10-12 19:47:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:33,230 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-10-12 19:47:33,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 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-10-12 19:47:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-10-12 19:47:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:47:33,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:33,231 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:33,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-12 19:47:33,432 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-10-12 19:47:33,432 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:33,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1158839228, now seen corresponding path program 12 times [2024-10-12 19:47:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:33,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335137439] [2024-10-12 19:47:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:33,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:33,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:33,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:33,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:34,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:34,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:34,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:34,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:34,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-12 19:47:34,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:34,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335137439] [2024-10-12 19:47:34,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335137439] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214263773] [2024-10-12 19:47:34,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 19:47:34,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:34,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:34,248 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-10-12 19:47:34,251 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-10-12 19:47:34,672 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-10-12 19:47:34,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:34,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 19:47:34,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-12 19:47:34,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 19:47:41,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214263773] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:41,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:41,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 32 [2024-10-12 19:47:41,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353931810] [2024-10-12 19:47:41,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:41,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-12 19:47:41,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:41,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-12 19:47:41,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2024-10-12 19:47:41,959 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 32 states, 30 states have (on average 2.066666666666667) internal successors, (62), 31 states have internal predecessors, (62), 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-10-12 19:47:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:42,134 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2024-10-12 19:47:42,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 19:47:42,134 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.066666666666667) internal successors, (62), 31 states have internal predecessors, (62), 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 81 [2024-10-12 19:47:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:42,135 INFO L225 Difference]: With dead ends: 54 [2024-10-12 19:47:42,135 INFO L226 Difference]: Without dead ends: 50 [2024-10-12 19:47:42,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 158 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-10-12 19:47:42,137 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 77 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:42,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 77 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:47:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-12 19:47:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-12 19:47:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 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-10-12 19:47:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2024-10-12 19:47:42,148 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2024-10-12 19:47:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:42,148 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-10-12 19:47:42,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.066666666666667) internal successors, (62), 31 states have internal predecessors, (62), 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-10-12 19:47:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2024-10-12 19:47:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 19:47:42,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:42,151 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:42,170 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-10-12 19:47:42,355 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-10-12 19:47:42,356 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:42,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:42,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1570097358, now seen corresponding path program 13 times [2024-10-12 19:47:42,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:42,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865662396] [2024-10-12 19:47:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:42,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:42,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:42,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:42,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-12 19:47:43,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:43,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865662396] [2024-10-12 19:47:43,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865662396] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:43,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746739142] [2024-10-12 19:47:43,493 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-12 19:47:43,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:43,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:43,495 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-10-12 19:47:43,499 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-10-12 19:47:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:43,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 19:47:43,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-12 19:47:44,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:47:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-12 19:47:53,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746739142] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:47:53,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:47:53,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 34 [2024-10-12 19:47:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716370429] [2024-10-12 19:47:53,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:47:53,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-12 19:47:53,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:47:53,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-12 19:47:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 19:47:53,313 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 34 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 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-10-12 19:47:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:47:53,478 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2024-10-12 19:47:53,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 19:47:53,478 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 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 87 [2024-10-12 19:47:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:47:53,479 INFO L225 Difference]: With dead ends: 57 [2024-10-12 19:47:53,479 INFO L226 Difference]: Without dead ends: 53 [2024-10-12 19:47:53,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 170 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-10-12 19:47:53,480 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 86 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:47:53,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 73 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:47:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-12 19:47:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-12 19:47:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 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-10-12 19:47:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2024-10-12 19:47:53,486 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2024-10-12 19:47:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:47:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2024-10-12 19:47:53,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 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-10-12 19:47:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-10-12 19:47:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 19:47:53,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:47:53,487 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:47:53,505 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-10-12 19:47:53,691 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-10-12 19:47:53,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:47:53,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:47:53,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1407069436, now seen corresponding path program 14 times [2024-10-12 19:47:53,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:47:53,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611126529] [2024-10-12 19:47:53,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:47:53,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:47:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:47:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:53,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:47:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:47:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-12 19:47:54,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:47:54,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611126529] [2024-10-12 19:47:54,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611126529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:47:54,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876126272] [2024-10-12 19:47:54,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:47:54,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:47:54,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:47:54,697 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-10-12 19:47:54,698 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-10-12 19:47:55,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:47:55,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:47:55,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 19:47:55,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:47:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-12 19:47:55,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:48:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-12 19:48:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876126272] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:48:06,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:48:06,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2024-10-12 19:48:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294820279] [2024-10-12 19:48:06,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:48:06,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-12 19:48:06,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:06,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 19:48:06,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 19:48:06,654 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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-10-12 19:48:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:06,804 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2024-10-12 19:48:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 19:48:06,805 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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 93 [2024-10-12 19:48:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:06,805 INFO L225 Difference]: With dead ends: 60 [2024-10-12 19:48:06,805 INFO L226 Difference]: Without dead ends: 56 [2024-10-12 19:48:06,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 182 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-10-12 19:48:06,807 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:06,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 79 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:48:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-12 19:48:06,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-12 19:48:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 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-10-12 19:48:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-10-12 19:48:06,812 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2024-10-12 19:48:06,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:06,813 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-10-12 19:48:06,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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-10-12 19:48:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-10-12 19:48:06,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 19:48:06,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:06,814 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:06,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-12 19:48:07,014 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-10-12 19:48:07,015 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:48:07,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:07,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1758730226, now seen corresponding path program 15 times [2024-10-12 19:48:07,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:07,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122352647] [2024-10-12 19:48:07,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:07,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:48:07,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 19:48:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:48:07,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 19:48:07,086 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 19:48:07,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:48:07,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:48:07,094 INFO L407 BasicCegarLoop]: Path program histogram: [15, 1] [2024-10-12 19:48:07,143 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:48:07,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:48:07 BoogieIcfgContainer [2024-10-12 19:48:07,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:48:07,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:48:07,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:48:07,147 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:48:07,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:47:00" (3/4) ... [2024-10-12 19:48:07,148 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 19:48:07,205 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:48:07,205 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:48:07,206 INFO L158 Benchmark]: Toolchain (without parser) took 67108.26ms. Allocated memory was 151.0MB in the beginning and 559.9MB in the end (delta: 408.9MB). Free memory was 76.7MB in the beginning and 270.2MB in the end (delta: -193.5MB). Peak memory consumption was 215.7MB. Max. memory is 16.1GB. [2024-10-12 19:48:07,206 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 151.0MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:48:07,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.85ms. Allocated memory is still 151.0MB. Free memory was 76.4MB in the beginning and 121.7MB in the end (delta: -45.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-12 19:48:07,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.81ms. Allocated memory is still 151.0MB. Free memory was 121.7MB in the beginning and 120.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:48:07,207 INFO L158 Benchmark]: Boogie Preprocessor took 27.07ms. Allocated memory is still 151.0MB. Free memory was 120.4MB in the beginning and 119.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:48:07,207 INFO L158 Benchmark]: RCFGBuilder took 285.13ms. Allocated memory is still 151.0MB. Free memory was 119.0MB in the beginning and 108.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 19:48:07,207 INFO L158 Benchmark]: TraceAbstraction took 66429.50ms. Allocated memory was 151.0MB in the beginning and 559.9MB in the end (delta: 408.9MB). Free memory was 107.8MB in the beginning and 273.3MB in the end (delta: -165.6MB). Peak memory consumption was 243.1MB. Max. memory is 16.1GB. [2024-10-12 19:48:07,207 INFO L158 Benchmark]: Witness Printer took 58.49ms. Allocated memory is still 559.9MB. Free memory was 273.3MB in the beginning and 270.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:48:07,208 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.12ms. Allocated memory is still 151.0MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.85ms. Allocated memory is still 151.0MB. Free memory was 76.4MB in the beginning and 121.7MB in the end (delta: -45.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.81ms. Allocated memory is still 151.0MB. Free memory was 121.7MB in the beginning and 120.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.07ms. Allocated memory is still 151.0MB. Free memory was 120.4MB in the beginning and 119.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 285.13ms. Allocated memory is still 151.0MB. Free memory was 119.0MB in the beginning and 108.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 66429.50ms. Allocated memory was 151.0MB in the beginning and 559.9MB in the end (delta: 408.9MB). Free memory was 107.8MB in the beginning and 273.3MB in the end (delta: -165.6MB). Peak memory consumption was 243.1MB. Max. memory is 16.1GB. * Witness Printer took 58.49ms. Allocated memory is still 559.9MB. Free memory was 273.3MB in the beginning and 270.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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, 14 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, 908 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 758 mSDsluCounter, 814 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 694 mSDsCounter, 298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1200 IncrementalHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 298 mSolverCounterUnsat, 120 mSDtfsCounter, 1200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 1458 SyntacticMatches, 120 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5366 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred 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.3s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 2234 ConstructedInterpolants, 0 QuantifiedInterpolants, 6624 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-10-12 19:48:07,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE