./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i15_o15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i15_o15-1.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 715908359373978289cc76ce2f00faf49f4d4a3c6ddae64771646fc969bea981 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:59:53,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:59:53,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:59:53,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:59:53,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:59:53,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:59:53,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:59:53,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:59:53,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:59:53,229 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:59:53,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:59:53,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:59:53,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:59:53,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:59:53,230 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:59:53,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:59:53,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:59:53,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:59:53,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:59:53,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:59:53,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:59:53,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:59:53,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:59:53,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:59:53,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:59:53,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:59:53,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:59:53,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:59:53,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:59:53,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:59:53,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:59:53,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:59:53,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:59:53,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:59:53,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:59:53,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:59:53,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:59:53,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:59:53,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:59:53,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:59:53,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:59:53,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:59:53,237 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 -> 715908359373978289cc76ce2f00faf49f4d4a3c6ddae64771646fc969bea981 [2024-11-11 20:59:53,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:59:53,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:59:53,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:59:53,474 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:59:53,474 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:59:53,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i15_o15-1.c [2024-11-11 20:59:54,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:59:55,008 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:59:55,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-1.c [2024-11-11 20:59:55,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1d4439b/090dbaae7deb413f82f049857547d22f/FLAG30957e82a [2024-11-11 20:59:55,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1d4439b/090dbaae7deb413f82f049857547d22f [2024-11-11 20:59:55,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:59:55,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:59:55,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:59:55,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:59:55,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:59:55,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d956296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55, skipping insertion in model container [2024-11-11 20:59:55,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:59:55,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-1.c[454,467] [2024-11-11 20:59:55,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:59:55,576 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:59:55,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-1.c[454,467] [2024-11-11 20:59:55,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:59:55,598 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:59:55,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55 WrapperNode [2024-11-11 20:59:55,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:59:55,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:59:55,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:59:55,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:59:55,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,618 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2024-11-11 20:59:55,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:59:55,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:59:55,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:59:55,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:59:55,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,633 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:59:55,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:59:55,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:59:55,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:59:55,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:59:55,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (1/1) ... [2024-11-11 20:59:55,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:59:55,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:59:55,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:59:55,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:59:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:59:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:59:55,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:59:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:59:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-11 20:59:55,697 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-11 20:59:55,744 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:59:55,745 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:59:55,807 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-11 20:59:55,807 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:59:55,815 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:59:55,816 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 20:59:55,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:59:55 BoogieIcfgContainer [2024-11-11 20:59:55,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:59:55,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:59:55,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:59:55,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:59:55,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:59:55" (1/3) ... [2024-11-11 20:59:55,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ebb745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:59:55, skipping insertion in model container [2024-11-11 20:59:55,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:59:55" (2/3) ... [2024-11-11 20:59:55,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ebb745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:59:55, skipping insertion in model container [2024-11-11 20:59:55,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:59:55" (3/3) ... [2024-11-11 20:59:55,823 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i15_o15-1.c [2024-11-11 20:59:55,840 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:59:55,840 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:59:55,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:59:55,895 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;@650901d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:59:55,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:59:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:59:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 20:59:55,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:59:55,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:59:55,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:59:55,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:59:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2024-11-11 20:59:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:59:55,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221537085] [2024-11-11 20:59:55,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:55,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:59:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:56,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:59:56,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:59:56,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221537085] [2024-11-11 20:59:56,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221537085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:59:56,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:59:56,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:59:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182377881] [2024-11-11 20:59:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:59:56,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:59:56,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:59:56,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:59:56,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:59:56,181 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:59:56,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:59:56,304 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-11 20:59:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:59:56,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-11 20:59:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:59:56,312 INFO L225 Difference]: With dead ends: 25 [2024-11-11 20:59:56,313 INFO L226 Difference]: Without dead ends: 15 [2024-11-11 20:59:56,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:59:56,318 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:59:56,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:59:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-11 20:59:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-11 20:59:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:59:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-11 20:59:56,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-11 20:59:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:59:56,350 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-11 20:59:56,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:59:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-11 20:59:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 20:59:56,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:59:56,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:59:56,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:59:56,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:59:56,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:59:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2024-11-11 20:59:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:59:56,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635478434] [2024-11-11 20:59:56,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:59:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:56,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 20:59:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:59:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635478434] [2024-11-11 20:59:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635478434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:59:56,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740738284] [2024-11-11 20:59:56,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:56,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:56,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:59:56,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:59:56,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:59:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:56,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:59:56,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:59:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 20:59:56,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:59:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 20:59:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740738284] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:59:56,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:59:56,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2024-11-11 20:59:56,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301923145] [2024-11-11 20:59:56,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:59:56,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 20:59:56,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:59:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 20:59:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:59:56,812 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 13 states, 10 states have (on average 2.2) internal successors, (22), 13 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 20:59:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:59:56,860 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-11 20:59:56,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:59:56,861 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 13 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) Word has length 16 [2024-11-11 20:59:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:59:56,862 INFO L225 Difference]: With dead ends: 22 [2024-11-11 20:59:56,862 INFO L226 Difference]: Without dead ends: 18 [2024-11-11 20:59:56,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:59:56,863 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:59:56,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:59:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-11 20:59:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-11 20:59:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:59:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-11 20:59:56,870 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2024-11-11 20:59:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:59:56,870 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-11 20:59:56,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 13 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 20:59:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-11 20:59:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 20:59:56,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:59:56,872 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:59:56,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:59:57,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:57,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:59:57,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:59:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2024-11-11 20:59:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:59:57,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467045] [2024-11-11 20:59:57,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:59:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:59:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:59:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467045] [2024-11-11 20:59:57,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:59:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748091839] [2024-11-11 20:59:57,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 20:59:57,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:57,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:59:57,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:59:57,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:59:57,358 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 20:59:57,359 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:59:57,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:59:57,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:59:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 20:59:57,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:59:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:59:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748091839] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:59:57,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:59:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 15 [2024-11-11 20:59:57,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784086038] [2024-11-11 20:59:57,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:59:57,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 20:59:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:59:57,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 20:59:57,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:59:57,644 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 15 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 20:59:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:59:57,681 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-11 20:59:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:59:57,682 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 15 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2024-11-11 20:59:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:59:57,682 INFO L225 Difference]: With dead ends: 25 [2024-11-11 20:59:57,683 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 20:59:57,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:59:57,684 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:59:57,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 57 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:59:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 20:59:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-11 20:59:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 20:59:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-11 20:59:57,688 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2024-11-11 20:59:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:59:57,688 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-11 20:59:57,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 15 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 20:59:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-11 20:59:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 20:59:57,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:59:57,689 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:59:57,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:59:57,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-11 20:59:57,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:59:57,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:59:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2024-11-11 20:59:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:59:57,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246806687] [2024-11-11 20:59:57,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:59:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:58,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:58,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:59:58,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:59:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246806687] [2024-11-11 20:59:58,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246806687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:59:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297309492] [2024-11-11 20:59:58,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 20:59:58,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:58,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:59:58,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:59:58,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:59:58,235 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-11 20:59:58,235 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:59:58,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 20:59:58,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:59:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 20:59:58,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:59:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 20:59:58,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297309492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:59:58,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:59:58,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2024-11-11 20:59:58,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134360892] [2024-11-11 20:59:58,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:59:58,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-11 20:59:58,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:59:58,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-11 20:59:58,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:59:58,729 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 17 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-11 20:59:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:59:58,776 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-11 20:59:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:59:58,776 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 17 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) Word has length 28 [2024-11-11 20:59:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:59:58,777 INFO L225 Difference]: With dead ends: 28 [2024-11-11 20:59:58,777 INFO L226 Difference]: Without dead ends: 24 [2024-11-11 20:59:58,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:59:58,778 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:59:58,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 62 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:59:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-11 20:59:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-11 20:59:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 20:59:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-11 20:59:58,782 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 28 [2024-11-11 20:59:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:59:58,782 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-11 20:59:58,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 17 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-11 20:59:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-11 20:59:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 20:59:58,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:59:58,783 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:59:58,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 20:59:58,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:58,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:59:58,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:59:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash 371264716, now seen corresponding path program 4 times [2024-11-11 20:59:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:59:58,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166419066] [2024-11-11 20:59:58,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:59:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:59:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:59:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:59:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:59:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:59:59,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166419066] [2024-11-11 20:59:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166419066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:59:59,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61951474] [2024-11-11 20:59:59,201 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 20:59:59,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:59:59,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:59:59,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:59:59,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:59:59,246 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 20:59:59,246 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:59:59,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 20:59:59,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:59:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 20:59:59,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:59:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 20:59:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61951474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:59:59,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:59:59,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 19 [2024-11-11 20:59:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329553316] [2024-11-11 20:59:59,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:59:59,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 20:59:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:59:59,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 20:59:59,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:59:59,975 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 19 states, 16 states have (on average 2.125) internal successors, (34), 19 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2024-11-11 21:00:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:00,053 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-11 21:00:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:00:00,054 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.125) internal successors, (34), 19 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) Word has length 34 [2024-11-11 21:00:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:00,054 INFO L225 Difference]: With dead ends: 31 [2024-11-11 21:00:00,054 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 21:00:00,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:00:00,055 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:00,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 59 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:00,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 21:00:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 21:00:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 21:00:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-11 21:00:00,060 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 34 [2024-11-11 21:00:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:00,060 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-11 21:00:00,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.125) internal successors, (34), 19 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2024-11-11 21:00:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-11 21:00:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-11 21:00:00,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:00,061 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:00,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 21:00:00,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:00,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:00,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:00,262 INFO L85 PathProgramCache]: Analyzing trace with hash -886339242, now seen corresponding path program 5 times [2024-11-11 21:00:00,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:00,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969058860] [2024-11-11 21:00:00,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:00,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:00,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:00,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:00,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 21:00:00,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:00,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969058860] [2024-11-11 21:00:00,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969058860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:00,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834601846] [2024-11-11 21:00:00,524 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 21:00:00,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:00,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:00,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:00,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 21:00:00,579 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-11 21:00:00,580 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:00,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-11 21:00:00,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 21:00:00,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:00:01,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834601846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:01,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:01,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 15] total 21 [2024-11-11 21:00:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214199789] [2024-11-11 21:00:01,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:01,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:00:01,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:01,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:00:01,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:00:01,533 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 21 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-11 21:00:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:01,607 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-11 21:00:01,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:00:01,608 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 21 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) Word has length 40 [2024-11-11 21:00:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:01,608 INFO L225 Difference]: With dead ends: 34 [2024-11-11 21:00:01,608 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 21:00:01,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2024-11-11 21:00:01,609 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:01,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 79 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 21:00:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-11 21:00:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 21:00:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-11 21:00:01,613 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 40 [2024-11-11 21:00:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:01,613 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-11 21:00:01,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 21 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-11 21:00:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-11 21:00:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 21:00:01,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:01,614 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:01,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:01,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:01,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:01,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash -918712436, now seen corresponding path program 6 times [2024-11-11 21:00:01,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:01,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804615701] [2024-11-11 21:00:01,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:01,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:01,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:01,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:01,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:01,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-11 21:00:02,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:02,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804615701] [2024-11-11 21:00:02,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804615701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:02,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089201035] [2024-11-11 21:00:02,073 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-11 21:00:02,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:02,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:02,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:02,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 21:00:02,131 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-11 21:00:02,132 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:02,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 21:00:02,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-11 21:00:02,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 21:00:03,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089201035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:03,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:03,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 23 [2024-11-11 21:00:03,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737157181] [2024-11-11 21:00:03,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:03,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 21:00:03,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:03,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 21:00:03,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:00:03,985 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 23 states, 20 states have (on average 2.1) internal successors, (42), 23 states have internal predecessors, (42), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-11 21:00:04,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:04,104 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-11 21:00:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:00:04,105 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.1) internal successors, (42), 23 states have internal predecessors, (42), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) Word has length 46 [2024-11-11 21:00:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:04,105 INFO L225 Difference]: With dead ends: 37 [2024-11-11 21:00:04,106 INFO L226 Difference]: Without dead ends: 33 [2024-11-11 21:00:04,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 86 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2024-11-11 21:00:04,107 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 54 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:04,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 80 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-11 21:00:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-11 21:00:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 21:00:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-11 21:00:04,116 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 46 [2024-11-11 21:00:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:04,119 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-11 21:00:04,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.1) internal successors, (42), 23 states have internal predecessors, (42), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-11 21:00:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-11 21:00:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:00:04,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:04,122 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:04,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:04,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:04,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:04,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 7 times [2024-11-11 21:00:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:04,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494156058] [2024-11-11 21:00:04,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:04,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:04,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:04,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:04,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:04,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 21:00:04,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:04,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494156058] [2024-11-11 21:00:04,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494156058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:04,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904434399] [2024-11-11 21:00:04,645 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-11 21:00:04,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:04,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:04,647 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:04,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 21:00:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:04,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 21:00:04,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 21:00:04,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 21:00:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904434399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:06,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:06,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 19] total 25 [2024-11-11 21:00:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260529378] [2024-11-11 21:00:06,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:06,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 21:00:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:06,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 21:00:06,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:00:06,962 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 25 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-11 21:00:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:07,083 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-11 21:00:07,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:00:07,083 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 25 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) Word has length 52 [2024-11-11 21:00:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:07,086 INFO L225 Difference]: With dead ends: 40 [2024-11-11 21:00:07,086 INFO L226 Difference]: Without dead ends: 36 [2024-11-11 21:00:07,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 98 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=695, Unknown=0, NotChecked=0, Total=992 [2024-11-11 21:00:07,091 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 60 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:07,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 93 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-11 21:00:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-11 21:00:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 21:00:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-11 21:00:07,099 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2024-11-11 21:00:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:07,101 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-11 21:00:07,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 25 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-11 21:00:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-11 21:00:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 21:00:07,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:07,105 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:07,118 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-11-11 21:00:07,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:07,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:07,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 8 times [2024-11-11 21:00:07,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:07,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189289317] [2024-11-11 21:00:07,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:07,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:07,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:07,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:07,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:07,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:07,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:07,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-11 21:00:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189289317] [2024-11-11 21:00:07,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189289317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233840193] [2024-11-11 21:00:07,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:00:07,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:07,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:07,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:07,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 21:00:08,151 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 21:00:08,151 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:08,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 21:00:08,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-11 21:00:08,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 21:00:10,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233840193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:10,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:10,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 21] total 27 [2024-11-11 21:00:10,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478230944] [2024-11-11 21:00:10,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:10,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-11 21:00:10,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:10,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-11 21:00:10,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2024-11-11 21:00:10,620 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 27 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 27 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (27), 9 states have call predecessors, (27), 13 states have call successors, (27) [2024-11-11 21:00:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:10,716 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-11-11 21:00:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:00:10,717 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 27 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (27), 9 states have call predecessors, (27), 13 states have call successors, (27) Word has length 58 [2024-11-11 21:00:10,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:10,718 INFO L225 Difference]: With dead ends: 43 [2024-11-11 21:00:10,718 INFO L226 Difference]: Without dead ends: 39 [2024-11-11 21:00:10,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=359, Invalid=831, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 21:00:10,719 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 100 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:10,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 104 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-11 21:00:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-11 21:00:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 21:00:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-11 21:00:10,723 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 58 [2024-11-11 21:00:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:10,723 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-11 21:00:10,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 27 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (27), 9 states have call predecessors, (27), 13 states have call successors, (27) [2024-11-11 21:00:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-11 21:00:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 21:00:10,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:10,724 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:10,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:10,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-11 21:00:10,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:10,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:10,930 INFO L85 PathProgramCache]: Analyzing trace with hash -366706730, now seen corresponding path program 9 times [2024-11-11 21:00:10,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:10,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305428073] [2024-11-11 21:00:10,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:10,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-11 21:00:11,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:11,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305428073] [2024-11-11 21:00:11,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305428073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:11,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40427295] [2024-11-11 21:00:11,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 21:00:11,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:11,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:11,571 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:11,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 21:00:11,694 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-11 21:00:11,694 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:11,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-11 21:00:11,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-11 21:00:11,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-11 21:00:15,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40427295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:15,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:15,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 23] total 29 [2024-11-11 21:00:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611320086] [2024-11-11 21:00:15,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:15,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-11 21:00:15,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:15,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-11 21:00:15,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2024-11-11 21:00:15,118 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 29 states, 26 states have (on average 2.076923076923077) internal successors, (54), 29 states have internal predecessors, (54), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (30), 10 states have call predecessors, (30), 14 states have call successors, (30) [2024-11-11 21:00:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:15,229 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-11-11 21:00:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:00:15,230 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.076923076923077) internal successors, (54), 29 states have internal predecessors, (54), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (30), 10 states have call predecessors, (30), 14 states have call successors, (30) Word has length 64 [2024-11-11 21:00:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:15,230 INFO L225 Difference]: With dead ends: 46 [2024-11-11 21:00:15,230 INFO L226 Difference]: Without dead ends: 42 [2024-11-11 21:00:15,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 122 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=427, Invalid=979, Unknown=0, NotChecked=0, Total=1406 [2024-11-11 21:00:15,232 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:15,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 96 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-11 21:00:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-11 21:00:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 21:00:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-11-11 21:00:15,236 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 64 [2024-11-11 21:00:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:15,236 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-11-11 21:00:15,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.076923076923077) internal successors, (54), 29 states have internal predecessors, (54), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (30), 10 states have call predecessors, (30), 14 states have call successors, (30) [2024-11-11 21:00:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-11-11 21:00:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 21:00:15,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:15,237 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:15,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:15,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 21:00:15,442 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:15,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:15,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1719425780, now seen corresponding path program 10 times [2024-11-11 21:00:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614627030] [2024-11-11 21:00:15,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-11 21:00:15,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:15,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614627030] [2024-11-11 21:00:15,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614627030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:15,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914755865] [2024-11-11 21:00:15,924 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 21:00:15,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:15,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:15,926 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:15,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-11 21:00:16,089 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 21:00:16,089 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:16,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-11 21:00:16,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-11 21:00:16,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-11 21:00:20,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914755865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:20,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:20,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 25] total 31 [2024-11-11 21:00:20,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938319842] [2024-11-11 21:00:20,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:20,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-11 21:00:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-11 21:00:20,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2024-11-11 21:00:20,361 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 31 states have internal predecessors, (58), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (33), 11 states have call predecessors, (33), 15 states have call successors, (33) [2024-11-11 21:00:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:20,485 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-11-11 21:00:20,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:00:20,486 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 31 states have internal predecessors, (58), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (33), 11 states have call predecessors, (33), 15 states have call successors, (33) Word has length 70 [2024-11-11 21:00:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:20,487 INFO L225 Difference]: With dead ends: 49 [2024-11-11 21:00:20,487 INFO L226 Difference]: Without dead ends: 45 [2024-11-11 21:00:20,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 134 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=501, Invalid=1139, Unknown=0, NotChecked=0, Total=1640 [2024-11-11 21:00:20,488 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:20,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 116 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-11 21:00:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-11 21:00:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 21:00:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-11-11 21:00:20,498 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 70 [2024-11-11 21:00:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:20,499 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-11 21:00:20,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 31 states have internal predecessors, (58), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (33), 11 states have call predecessors, (33), 15 states have call successors, (33) [2024-11-11 21:00:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-11-11 21:00:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:00:20,502 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:20,502 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:20,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:20,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 21:00:20,704 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:20,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1354232598, now seen corresponding path program 11 times [2024-11-11 21:00:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:20,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091528215] [2024-11-11 21:00:20,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:20,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:20,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:21,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:21,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:21,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-11 21:00:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091528215] [2024-11-11 21:00:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091528215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21806595] [2024-11-11 21:00:21,275 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 21:00:21,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:21,278 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:21,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-11 21:00:21,498 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-11 21:00:21,499 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:21,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-11 21:00:21,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-11 21:00:21,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-11 21:00:27,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21806595] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:27,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:27,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 27] total 33 [2024-11-11 21:00:27,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654880081] [2024-11-11 21:00:27,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:27,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-11 21:00:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-11 21:00:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2024-11-11 21:00:27,120 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 33 states, 30 states have (on average 2.066666666666667) internal successors, (62), 33 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (36), 12 states have call predecessors, (36), 16 states have call successors, (36) [2024-11-11 21:00:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:27,335 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2024-11-11 21:00:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:00:27,335 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.066666666666667) internal successors, (62), 33 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (36), 12 states have call predecessors, (36), 16 states have call successors, (36) Word has length 76 [2024-11-11 21:00:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:27,336 INFO L225 Difference]: With dead ends: 52 [2024-11-11 21:00:27,336 INFO L226 Difference]: Without dead ends: 48 [2024-11-11 21:00:27,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 146 SyntacticMatches, 12 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=581, Invalid=1311, Unknown=0, NotChecked=0, Total=1892 [2024-11-11 21:00:27,337 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:27,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 127 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-11 21:00:27,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-11 21:00:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:00:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-11-11 21:00:27,351 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 76 [2024-11-11 21:00:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:27,354 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-11-11 21:00:27,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.066666666666667) internal successors, (62), 33 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (36), 12 states have call predecessors, (36), 16 states have call successors, (36) [2024-11-11 21:00:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-11-11 21:00:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:00:27,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:27,355 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:27,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:27,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-11 21:00:27,556 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:27,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:27,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1734686668, now seen corresponding path program 12 times [2024-11-11 21:00:27,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:27,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249836352] [2024-11-11 21:00:27,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:27,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:27,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:27,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-11 21:00:28,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:28,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249836352] [2024-11-11 21:00:28,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249836352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:28,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124997892] [2024-11-11 21:00:28,209 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-11 21:00:28,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:28,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:28,211 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:28,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-11 21:00:28,499 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-11-11 21:00:28,499 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:28,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-11 21:00:28,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:28,593 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-11 21:00:28,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-11 21:00:34,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124997892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:34,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:34,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 29] total 35 [2024-11-11 21:00:34,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572114461] [2024-11-11 21:00:34,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:34,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-11 21:00:34,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:34,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-11 21:00:34,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 21:00:34,901 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 35 states, 32 states have (on average 2.0625) internal successors, (66), 35 states have internal predecessors, (66), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (39), 13 states have call predecessors, (39), 17 states have call successors, (39) [2024-11-11 21:00:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:35,062 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2024-11-11 21:00:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 21:00:35,063 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.0625) internal successors, (66), 35 states have internal predecessors, (66), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (39), 13 states have call predecessors, (39), 17 states have call successors, (39) Word has length 82 [2024-11-11 21:00:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:35,064 INFO L225 Difference]: With dead ends: 55 [2024-11-11 21:00:35,065 INFO L226 Difference]: Without dead ends: 51 [2024-11-11 21:00:35,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 13 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=667, Invalid=1495, Unknown=0, NotChecked=0, Total=2162 [2024-11-11 21:00:35,066 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 173 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:35,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 123 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-11 21:00:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-11 21:00:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 21:00:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-11-11 21:00:35,076 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 82 [2024-11-11 21:00:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:35,076 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-11 21:00:35,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.0625) internal successors, (66), 35 states have internal predecessors, (66), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (39), 13 states have call predecessors, (39), 17 states have call successors, (39) [2024-11-11 21:00:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2024-11-11 21:00:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 21:00:35,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:35,077 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:35,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:35,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 21:00:35,281 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:35,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1433749930, now seen corresponding path program 13 times [2024-11-11 21:00:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528308201] [2024-11-11 21:00:35,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:36,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-11-11 21:00:36,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528308201] [2024-11-11 21:00:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528308201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009153241] [2024-11-11 21:00:36,072 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-11 21:00:36,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:36,073 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:36,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-11 21:00:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:36,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-11 21:00:36,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-11 21:00:36,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-11 21:00:44,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009153241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:44,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:44,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 31] total 37 [2024-11-11 21:00:44,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660466203] [2024-11-11 21:00:44,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:44,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-11 21:00:44,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-11 21:00:44,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 21:00:44,976 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 37 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 37 states have internal predecessors, (70), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (42), 14 states have call predecessors, (42), 18 states have call successors, (42) [2024-11-11 21:00:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:45,187 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2024-11-11 21:00:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:00:45,188 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 37 states have internal predecessors, (70), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (42), 14 states have call predecessors, (42), 18 states have call successors, (42) Word has length 88 [2024-11-11 21:00:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:45,188 INFO L225 Difference]: With dead ends: 58 [2024-11-11 21:00:45,188 INFO L226 Difference]: Without dead ends: 54 [2024-11-11 21:00:45,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 170 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=759, Invalid=1691, Unknown=0, NotChecked=0, Total=2450 [2024-11-11 21:00:45,189 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:45,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 132 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-11 21:00:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-11 21:00:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:00:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2024-11-11 21:00:45,207 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 88 [2024-11-11 21:00:45,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:45,208 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2024-11-11 21:00:45,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 37 states have internal predecessors, (70), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (42), 14 states have call predecessors, (42), 18 states have call successors, (42) [2024-11-11 21:00:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2024-11-11 21:00:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 21:00:45,210 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:45,210 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:45,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:45,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 21:00:45,419 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:45,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:45,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1321174388, now seen corresponding path program 14 times [2024-11-11 21:00:45,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:45,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93817587] [2024-11-11 21:00:45,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:45,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:45,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:45,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:45,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:45,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:45,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:45,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:45,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-11 21:00:46,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:46,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93817587] [2024-11-11 21:00:46,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93817587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:46,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244141993] [2024-11-11 21:00:46,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:00:46,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:46,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:46,129 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:46,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-11 21:00:46,597 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 21:00:46,598 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:46,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 21:00:46,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-11 21:00:46,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-11 21:00:56,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244141993] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:56,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:56,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 33] total 38 [2024-11-11 21:00:56,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392031558] [2024-11-11 21:00:56,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:56,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-11 21:00:56,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:56,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-11 21:00:56,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=1029, Unknown=0, NotChecked=0, Total=1406 [2024-11-11 21:00:56,938 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 38 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 38 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (44), 15 states have call predecessors, (44), 18 states have call successors, (44) [2024-11-11 21:00:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:57,081 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2024-11-11 21:00:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:00:57,082 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 38 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (44), 15 states have call predecessors, (44), 18 states have call successors, (44) Word has length 94 [2024-11-11 21:00:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:57,083 INFO L225 Difference]: With dead ends: 61 [2024-11-11 21:00:57,083 INFO L226 Difference]: Without dead ends: 57 [2024-11-11 21:00:57,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 182 SyntacticMatches, 16 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=853, Invalid=1799, Unknown=0, NotChecked=0, Total=2652 [2024-11-11 21:00:57,084 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:57,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 159 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-11 21:00:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-11 21:00:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-11 21:00:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-11 21:00:57,088 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 94 [2024-11-11 21:00:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:57,089 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-11 21:00:57,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 38 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (44), 15 states have call predecessors, (44), 18 states have call successors, (44) [2024-11-11 21:00:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-11 21:00:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:00:57,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:57,090 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:57,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-11 21:00:57,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:57,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:57,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:57,294 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 15 times [2024-11-11 21:00:57,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:57,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887560668] [2024-11-11 21:00:57,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:57,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:57,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:57,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:57,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:57,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 15 proven. 345 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-11 21:00:58,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887560668] [2024-11-11 21:00:58,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887560668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534547716] [2024-11-11 21:00:58,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 21:00:58,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:58,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:58,615 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:58,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-11 21:00:59,233 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-11-11 21:00:59,233 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:59,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-11 21:00:59,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-11 21:00:59,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:01:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-11 21:01:00,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534547716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:01:00,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:01:00,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 37 [2024-11-11 21:01:00,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953105598] [2024-11-11 21:01:00,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:01:00,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-11 21:01:00,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:01:00,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-11 21:01:00,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 21:01:00,201 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 16 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-11 21:01:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:01:01,074 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2024-11-11 21:01:01,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-11 21:01:01,074 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 16 states have call predecessors, (17), 1 states have call successors, (17) Word has length 100 [2024-11-11 21:01:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:01:01,075 INFO L225 Difference]: With dead ends: 64 [2024-11-11 21:01:01,075 INFO L226 Difference]: Without dead ends: 60 [2024-11-11 21:01:01,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=192, Invalid=4230, Unknown=0, NotChecked=0, Total=4422 [2024-11-11 21:01:01,077 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:01:01,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 754 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:01:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-11 21:01:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-11 21:01:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.025) internal successors, (41), 41 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (18), 17 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 21:01:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2024-11-11 21:01:01,081 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 100 [2024-11-11 21:01:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:01:01,081 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2024-11-11 21:01:01,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 16 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-11 21:01:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2024-11-11 21:01:01,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-11 21:01:01,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:01:01,082 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:01:01,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-11 21:01:01,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 21:01:01,283 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:01:01,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:01:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash 317812044, now seen corresponding path program 16 times [2024-11-11 21:01:01,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:01:01,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644677556] [2024-11-11 21:01:01,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:01:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:01:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 360 proven. 48 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-11 21:01:02,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:01:02,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644677556] [2024-11-11 21:01:02,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644677556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:01:02,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586768605] [2024-11-11 21:01:02,201 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 21:01:02,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:02,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:01:02,203 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:01:02,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-11 21:01:02,814 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 21:01:02,814 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:01:02,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-11 21:01:02,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:01:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-11 21:01:02,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:01:02,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586768605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:01:02,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:01:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [22] total 25 [2024-11-11 21:01:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937865138] [2024-11-11 21:01:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:01:02,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:01:02,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:01:02,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:01:02,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:01:02,937 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-11 21:01:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:01:03,146 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2024-11-11 21:01:03,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 21:01:03,146 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2024-11-11 21:01:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:01:03,146 INFO L225 Difference]: With dead ends: 60 [2024-11-11 21:01:03,147 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 21:01:03,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=508, Invalid=1132, Unknown=0, NotChecked=0, Total=1640 [2024-11-11 21:01:03,148 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:01:03,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 164 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:01:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 21:01:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 21:01:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:01:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 21:01:03,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2024-11-11 21:01:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:01:03,149 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 21:01:03,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-11 21:01:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 21:01:03,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 21:01:03,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 21:01:03,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-11 21:01:03,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 21:01:03,358 INFO L421 BasicCegarLoop]: Path program histogram: [16, 1] [2024-11-11 21:01:03,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 21:01:03,723 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 21:01:03,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 09:01:03 BoogieIcfgContainer [2024-11-11 21:01:03,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 21:01:03,755 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 21:01:03,755 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 21:01:03,755 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 21:01:03,756 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:59:55" (3/4) ... [2024-11-11 21:01:03,758 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 21:01:03,762 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2024-11-11 21:01:03,764 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 21:01:03,764 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 21:01:03,764 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 21:01:03,765 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 21:01:03,838 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 21:01:03,838 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 21:01:03,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 21:01:03,839 INFO L158 Benchmark]: Toolchain (without parser) took 68414.31ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 903.9MB). Free memory was 114.1MB in the beginning and 852.6MB in the end (delta: -738.4MB). Peak memory consumption was 167.0MB. Max. memory is 16.1GB. [2024-11-11 21:01:03,839 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:01:03,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.83ms. Allocated memory is still 184.5MB. Free memory was 114.1MB in the beginning and 102.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 21:01:03,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.49ms. Allocated memory is still 184.5MB. Free memory was 102.1MB in the beginning and 100.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:01:03,840 INFO L158 Benchmark]: Boogie Preprocessor took 19.44ms. Allocated memory is still 184.5MB. Free memory was 100.7MB in the beginning and 99.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:01:03,840 INFO L158 Benchmark]: RCFGBuilder took 177.50ms. Allocated memory is still 184.5MB. Free memory was 99.1MB in the beginning and 89.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 21:01:03,840 INFO L158 Benchmark]: TraceAbstraction took 67936.57ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 903.9MB). Free memory was 88.6MB in the beginning and 857.8MB in the end (delta: -769.2MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. [2024-11-11 21:01:03,840 INFO L158 Benchmark]: Witness Printer took 83.77ms. Allocated memory is still 1.1GB. Free memory was 857.8MB in the beginning and 852.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 21:01:03,841 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.14ms. Allocated memory is still 125.8MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.83ms. Allocated memory is still 184.5MB. Free memory was 114.1MB in the beginning and 102.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.49ms. Allocated memory is still 184.5MB. Free memory was 102.1MB in the beginning and 100.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.44ms. Allocated memory is still 184.5MB. Free memory was 100.7MB in the beginning and 99.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 177.50ms. Allocated memory is still 184.5MB. Free memory was 99.1MB in the beginning and 89.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 67936.57ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 903.9MB). Free memory was 88.6MB in the beginning and 857.8MB in the end (delta: -769.2MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. * Witness Printer took 83.77ms. Allocated memory is still 1.1GB. Free memory was 857.8MB in the beginning and 852.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.5s, OverallIterations: 17, TraceHistogramMax: 17, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 985 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 817 mSDsluCounter, 2294 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2065 mSDsCounter, 279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2255 IncrementalHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 279 mSolverCounterUnsat, 229 mSDtfsCounter, 2255 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2492 GetRequests, 1825 SyntacticMatches, 120 SemanticMatches, 547 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7042 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=16, InterpolantAutomatonStates: 237, 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, 17 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 57.3s InterpolantComputationTime, 1962 NumberOfCodeBlocks, 1962 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 2784 ConstructedInterpolants, 0 QuantifiedInterpolants, 7874 SizeOfPredicates, 121 NumberOfNonLiveVariables, 2576 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 48 InterpolantComputations, 2 PerfectInterpolantSequences, 6160/13088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id. Ensures: ((((((((((((((((((3 == \result) && (x == 3)) || (15 < x)) || ((11 == \result) && (x == 11))) || ((x == 6) && (6 == \result))) || ((9 == \result) && (x == 9))) || ((2 == \result) && (x == 2))) || ((10 == \result) && (x == 10))) || ((5 == \result) && (5 == x))) || ((8 == \result) && (x == 8))) || ((7 == \result) && (7 == x))) || ((12 == \result) && (x == 12))) || ((\result == 1) && (x == 1))) || ((14 == \result) && (x == 14))) || ((x == 4) && (4 == \result))) || ((x == 15) && (15 == \result))) || ((13 == \result) && (x == 13))) || ((\result == 0) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-11 21:01:03,873 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 Result: TRUE