./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 610248c6c4c4e7168ba971ed5fa38cec025658aa482465da336c99be91c3aa5c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:07:14,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:07:14,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:07:14,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:07:14,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:07:14,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:07:14,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:07:14,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:07:14,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:07:14,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:07:14,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:07:14,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:07:14,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:07:14,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:07:14,275 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:07:14,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:07:14,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:07:14,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:07:14,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:07:14,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:07:14,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:07:14,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:07:14,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:07:14,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:07:14,281 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:07:14,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:07:14,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:07:14,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:07:14,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:07:14,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:07:14,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:07:14,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:07:14,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:07:14,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:07:14,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:07:14,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:07:14,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:07:14,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:07:14,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:07:14,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:07:14,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:07:14,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:07:14,286 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 610248c6c4c4e7168ba971ed5fa38cec025658aa482465da336c99be91c3aa5c [2024-10-24 01:07:14,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:07:14,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:07:14,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:07:14,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:07:14,566 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:07:14,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-10-24 01:07:15,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:07:16,140 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:07:16,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-10-24 01:07:16,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb870b88/e3167a20aab14af480a6cb2329f71ac5/FLAG511285294 [2024-10-24 01:07:16,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb870b88/e3167a20aab14af480a6cb2329f71ac5 [2024-10-24 01:07:16,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:07:16,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:07:16,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:07:16,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:07:16,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:07:16,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc57cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16, skipping insertion in model container [2024-10-24 01:07:16,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:07:16,713 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c[481,494] [2024-10-24 01:07:16,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:07:16,728 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:07:16,742 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c[481,494] [2024-10-24 01:07:16,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:07:16,760 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:07:16,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16 WrapperNode [2024-10-24 01:07:16,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:07:16,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:07:16,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:07:16,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:07:16,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,792 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-10-24 01:07:16,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:07:16,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:07:16,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:07:16,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:07:16,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,817 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 01:07:16,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:07:16,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:07:16,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:07:16,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:07:16,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (1/1) ... [2024-10-24 01:07:16,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:07:16,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:16,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:07:16,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:07:16,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:07:16,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:07:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:07:16,939 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-10-24 01:07:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-10-24 01:07:16,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:07:17,017 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:07:17,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:07:17,134 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 01:07:17,134 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:07:17,165 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:07:17,167 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:07:17,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:07:17 BoogieIcfgContainer [2024-10-24 01:07:17,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:07:17,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:07:17,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:07:17,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:07:17,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:07:16" (1/3) ... [2024-10-24 01:07:17,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d0c3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:07:17, skipping insertion in model container [2024-10-24 01:07:17,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:07:16" (2/3) ... [2024-10-24 01:07:17,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d0c3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:07:17, skipping insertion in model container [2024-10-24 01:07:17,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:07:17" (3/3) ... [2024-10-24 01:07:17,175 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2024-10-24 01:07:17,186 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:07:17,186 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:07:17,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:07:17,238 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;@5c117414, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:07:17,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:07:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 01:07:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 01:07:17,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:17,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:17,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:17,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:17,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2024-10-24 01:07:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:17,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928730587] [2024-10-24 01:07:17,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:17,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:17,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:07:17,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:17,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928730587] [2024-10-24 01:07:17,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928730587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:07:17,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:07:17,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:07:17,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275068221] [2024-10-24 01:07:17,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:07:17,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:07:17,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:17,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:07:17,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:07:17,553 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:07:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:17,634 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-10-24 01:07:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:07:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-24 01:07:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:17,643 INFO L225 Difference]: With dead ends: 22 [2024-10-24 01:07:17,643 INFO L226 Difference]: Without dead ends: 14 [2024-10-24 01:07:17,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:07:17,650 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:17,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-24 01:07:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-24 01:07:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 01:07:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-24 01:07:17,688 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2024-10-24 01:07:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:17,689 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-24 01:07:17,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:07:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-24 01:07:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 01:07:17,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:17,693 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:17,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:07:17,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:17,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:17,694 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2024-10-24 01:07:17,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:17,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126333114] [2024-10-24 01:07:17,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:17,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:17,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:17,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:07:17,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126333114] [2024-10-24 01:07:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126333114] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119076811] [2024-10-24 01:07:17,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:17,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:17,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:17,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:17,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:07:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:18,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 01:07:18,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:07:18,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 01:07:18,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119076811] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:18,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:18,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2024-10-24 01:07:18,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2351233] [2024-10-24 01:07:18,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:18,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 01:07:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 01:07:18,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:07:18,410 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 01:07:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:18,478 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-10-24 01:07:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:07:18,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 15 [2024-10-24 01:07:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:18,479 INFO L225 Difference]: With dead ends: 21 [2024-10-24 01:07:18,480 INFO L226 Difference]: Without dead ends: 17 [2024-10-24 01:07:18,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:07:18,481 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:18,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:07:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-24 01:07:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-24 01:07:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 01:07:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-10-24 01:07:18,488 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2024-10-24 01:07:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:18,489 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-24 01:07:18,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 01:07:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-10-24 01:07:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 01:07:18,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:18,490 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:18,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 01:07:18,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:18,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:18,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2024-10-24 01:07:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:18,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810384143] [2024-10-24 01:07:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:18,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:18,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 01:07:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810384143] [2024-10-24 01:07:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810384143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636232751] [2024-10-24 01:07:18,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 01:07:18,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:18,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:18,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:18,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 01:07:19,012 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 01:07:19,012 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:07:19,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 01:07:19,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 01:07:19,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 01:07:19,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636232751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:19,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:19,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2024-10-24 01:07:19,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534238649] [2024-10-24 01:07:19,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:19,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:07:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:19,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:07:19,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:07:19,381 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-24 01:07:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:19,444 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-10-24 01:07:19,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:07:19,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 21 [2024-10-24 01:07:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:19,445 INFO L225 Difference]: With dead ends: 24 [2024-10-24 01:07:19,446 INFO L226 Difference]: Without dead ends: 20 [2024-10-24 01:07:19,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:07:19,447 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:19,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:07:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-24 01:07:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-24 01:07:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:07:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-24 01:07:19,456 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2024-10-24 01:07:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:19,456 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-24 01:07:19,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-24 01:07:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-24 01:07:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 01:07:19,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:19,459 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:19,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 01:07:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 01:07:19,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:19,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2024-10-24 01:07:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099179764] [2024-10-24 01:07:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:19,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:19,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:19,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:19,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:19,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 01:07:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:19,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099179764] [2024-10-24 01:07:19,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099179764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:19,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614981970] [2024-10-24 01:07:19,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 01:07:19,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:19,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:19,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:19,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 01:07:19,907 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-24 01:07:19,907 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:07:19,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 01:07:19,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 01:07:19,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:07:20,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614981970] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:20,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:20,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2024-10-24 01:07:20,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661110942] [2024-10-24 01:07:20,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:20,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 01:07:20,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 01:07:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:07:20,555 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-24 01:07:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:20,639 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-10-24 01:07:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:07:20,641 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 27 [2024-10-24 01:07:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:20,642 INFO L225 Difference]: With dead ends: 27 [2024-10-24 01:07:20,642 INFO L226 Difference]: Without dead ends: 23 [2024-10-24 01:07:20,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:07:20,643 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:20,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 44 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-24 01:07:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-24 01:07:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 01:07:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-24 01:07:20,650 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2024-10-24 01:07:20,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:20,651 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-24 01:07:20,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-24 01:07:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-24 01:07:20,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 01:07:20,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:20,652 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:20,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 01:07:20,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:20,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:20,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2024-10-24 01:07:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117351918] [2024-10-24 01:07:20,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:20,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:21,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:21,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:21,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 01:07:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117351918] [2024-10-24 01:07:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117351918] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009599409] [2024-10-24 01:07:21,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 01:07:21,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:21,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:21,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:21,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 01:07:21,163 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 01:07:21,163 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:07:21,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 01:07:21,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 01:07:21,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 01:07:21,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009599409] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:21,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:21,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-10-24 01:07:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669426088] [2024-10-24 01:07:21,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:21,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 01:07:21,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 01:07:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:07:21,941 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2024-10-24 01:07:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:22,028 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-24 01:07:22,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:07:22,029 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) Word has length 33 [2024-10-24 01:07:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:22,030 INFO L225 Difference]: With dead ends: 30 [2024-10-24 01:07:22,030 INFO L226 Difference]: Without dead ends: 26 [2024-10-24 01:07:22,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:07:22,032 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:22,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 45 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-24 01:07:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-24 01:07:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:07:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-24 01:07:22,041 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2024-10-24 01:07:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:22,042 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-24 01:07:22,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2024-10-24 01:07:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-24 01:07:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 01:07:22,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:22,044 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:22,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 01:07:22,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:22,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:22,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2024-10-24 01:07:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:22,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022809813] [2024-10-24 01:07:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:22,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:22,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:22,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:22,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 01:07:22,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022809813] [2024-10-24 01:07:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022809813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769450658] [2024-10-24 01:07:22,525 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 01:07:22,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:22,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:22,529 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:22,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 01:07:22,592 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-24 01:07:22,593 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:07:22,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 01:07:22,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 01:07:22,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 01:07:23,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769450658] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:23,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:23,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2024-10-24 01:07:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115543889] [2024-10-24 01:07:23,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:23,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 01:07:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:23,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 01:07:23,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:07:23,709 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-24 01:07:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:23,807 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-10-24 01:07:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 01:07:23,807 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) Word has length 39 [2024-10-24 01:07:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:23,808 INFO L225 Difference]: With dead ends: 33 [2024-10-24 01:07:23,809 INFO L226 Difference]: Without dead ends: 29 [2024-10-24 01:07:23,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:07:23,810 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:23,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 45 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-24 01:07:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-24 01:07:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:07:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-10-24 01:07:23,819 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2024-10-24 01:07:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:23,819 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-10-24 01:07:23,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-24 01:07:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-10-24 01:07:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 01:07:23,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:23,828 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:23,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 01:07:24,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:24,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:24,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2024-10-24 01:07:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:24,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995747716] [2024-10-24 01:07:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:24,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:24,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:24,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:24,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 01:07:24,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995747716] [2024-10-24 01:07:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995747716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820002469] [2024-10-24 01:07:24,363 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-24 01:07:24,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:24,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:24,365 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:24,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 01:07:24,437 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-24 01:07:24,437 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:07:24,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 01:07:24,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 01:07:24,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-24 01:07:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820002469] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:25,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:25,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2024-10-24 01:07:25,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395363097] [2024-10-24 01:07:25,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:25,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 01:07:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:25,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 01:07:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:07:25,859 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-24 01:07:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:25,958 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-24 01:07:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:07:25,959 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) Word has length 45 [2024-10-24 01:07:25,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:25,960 INFO L225 Difference]: With dead ends: 36 [2024-10-24 01:07:25,960 INFO L226 Difference]: Without dead ends: 32 [2024-10-24 01:07:25,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:07:25,961 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:25,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 54 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-24 01:07:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-24 01:07:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 01:07:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-10-24 01:07:25,966 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2024-10-24 01:07:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:25,967 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-10-24 01:07:25,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-24 01:07:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-10-24 01:07:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 01:07:25,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:25,968 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:25,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 01:07:26,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:26,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:26,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2024-10-24 01:07:26,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:26,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277588531] [2024-10-24 01:07:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:26,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:26,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:26,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:26,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:26,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-24 01:07:26,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:26,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277588531] [2024-10-24 01:07:26,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277588531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:26,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920722497] [2024-10-24 01:07:26,578 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-24 01:07:26,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:26,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:26,580 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:26,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 01:07:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:26,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 01:07:26,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-24 01:07:26,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 01:07:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920722497] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:28,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:28,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2024-10-24 01:07:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31026431] [2024-10-24 01:07:28,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:28,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 01:07:28,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:28,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 01:07:28,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:07:28,582 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 22 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-10-24 01:07:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:28,682 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-10-24 01:07:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:07:28,682 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 51 [2024-10-24 01:07:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:28,683 INFO L225 Difference]: With dead ends: 39 [2024-10-24 01:07:28,683 INFO L226 Difference]: Without dead ends: 35 [2024-10-24 01:07:28,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2024-10-24 01:07:28,684 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:28,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 51 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-24 01:07:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-24 01:07:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 01:07:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-10-24 01:07:28,693 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2024-10-24 01:07:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:28,694 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-10-24 01:07:28,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-10-24 01:07:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-10-24 01:07:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 01:07:28,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:28,697 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:28,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-24 01:07:28,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:28,897 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:28,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2024-10-24 01:07:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:28,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600887099] [2024-10-24 01:07:28,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:29,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:29,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:29,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:29,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 01:07:29,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:29,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600887099] [2024-10-24 01:07:29,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600887099] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:29,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779960969] [2024-10-24 01:07:29,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 01:07:29,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:29,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:29,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:29,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 01:07:29,481 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 01:07:29,481 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:07:29,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 01:07:29,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 01:07:29,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 01:07:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779960969] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:32,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:32,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2024-10-24 01:07:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089726892] [2024-10-24 01:07:32,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:32,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 01:07:32,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 01:07:32,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2024-10-24 01:07:32,151 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2024-10-24 01:07:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:32,294 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-10-24 01:07:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:07:32,294 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 57 [2024-10-24 01:07:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:32,296 INFO L225 Difference]: With dead ends: 42 [2024-10-24 01:07:32,297 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 01:07:32,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2024-10-24 01:07:32,298 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:32,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 56 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 01:07:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 01:07:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 01:07:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-10-24 01:07:32,308 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2024-10-24 01:07:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:32,308 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-10-24 01:07:32,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2024-10-24 01:07:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-10-24 01:07:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:07:32,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:32,313 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:32,331 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-10-24 01:07:32,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-24 01:07:32,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:32,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2024-10-24 01:07:32,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:32,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086646494] [2024-10-24 01:07:32,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:32,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:32,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:32,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:32,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:32,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:32,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:33,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:33,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:33,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-24 01:07:33,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:33,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086646494] [2024-10-24 01:07:33,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086646494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:33,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583263376] [2024-10-24 01:07:33,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 01:07:33,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:33,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:33,136 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:33,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 01:07:33,304 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-24 01:07:33,304 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:07:33,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 01:07:33,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-24 01:07:33,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 01:07:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583263376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:36,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:36,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 26 [2024-10-24 01:07:36,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802613241] [2024-10-24 01:07:36,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:36,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 01:07:36,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:36,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 01:07:36,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:07:36,775 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 26 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2024-10-24 01:07:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:36,902 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-10-24 01:07:36,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:07:36,903 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) Word has length 63 [2024-10-24 01:07:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:36,904 INFO L225 Difference]: With dead ends: 45 [2024-10-24 01:07:36,904 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 01:07:36,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 122 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=812, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 01:07:36,905 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 93 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:36,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 64 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 01:07:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-24 01:07:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 01:07:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-10-24 01:07:36,911 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2024-10-24 01:07:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:36,911 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-10-24 01:07:36,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2024-10-24 01:07:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-10-24 01:07:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:07:36,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:36,912 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:36,929 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-10-24 01:07:37,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 01:07:37,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:37,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2024-10-24 01:07:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242188821] [2024-10-24 01:07:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-24 01:07:37,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:37,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242188821] [2024-10-24 01:07:37,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242188821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:37,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540809315] [2024-10-24 01:07:37,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 01:07:37,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:37,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:37,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:37,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 01:07:37,982 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 01:07:37,982 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:07:37,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 01:07:37,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-24 01:07:38,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 01:07:42,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540809315] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:42,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:42,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 28 [2024-10-24 01:07:42,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697956401] [2024-10-24 01:07:42,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:42,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 01:07:42,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:42,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 01:07:42,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2024-10-24 01:07:42,580 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 28 states, 26 states have (on average 2.076923076923077) internal successors, (54), 27 states have internal predecessors, (54), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2024-10-24 01:07:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:42,727 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-10-24 01:07:42,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:07:42,728 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.076923076923077) internal successors, (54), 27 states have internal predecessors, (54), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) Word has length 69 [2024-10-24 01:07:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:42,729 INFO L225 Difference]: With dead ends: 48 [2024-10-24 01:07:42,729 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 01:07:42,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 134 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=448, Invalid=958, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 01:07:42,730 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 109 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:42,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 68 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 01:07:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 01:07:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 01:07:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2024-10-24 01:07:42,735 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2024-10-24 01:07:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:42,735 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2024-10-24 01:07:42,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.076923076923077) internal successors, (54), 27 states have internal predecessors, (54), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2024-10-24 01:07:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2024-10-24 01:07:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:07:42,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:42,737 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:42,752 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-10-24 01:07:42,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 01:07:42,937 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:42,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash -776930930, now seen corresponding path program 11 times [2024-10-24 01:07:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381428421] [2024-10-24 01:07:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-24 01:07:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381428421] [2024-10-24 01:07:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381428421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460132638] [2024-10-24 01:07:43,734 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 01:07:43,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:43,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:43,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:43,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-24 01:07:44,033 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-24 01:07:44,033 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:07:44,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 01:07:44,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-24 01:07:44,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 01:07:49,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460132638] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:49,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:49,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 30 [2024-10-24 01:07:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088065768] [2024-10-24 01:07:49,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:49,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-24 01:07:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-24 01:07:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2024-10-24 01:07:49,926 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 30 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2024-10-24 01:07:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:50,092 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2024-10-24 01:07:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:07:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) Word has length 75 [2024-10-24 01:07:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:50,093 INFO L225 Difference]: With dead ends: 51 [2024-10-24 01:07:50,093 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 01:07:50,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 146 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 01:07:50,094 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:50,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 72 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 01:07:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 01:07:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 01:07:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-10-24 01:07:50,102 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2024-10-24 01:07:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:50,102 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-10-24 01:07:50,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2024-10-24 01:07:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-10-24 01:07:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:07:50,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:50,104 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:50,117 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-10-24 01:07:50,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-24 01:07:50,307 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:50,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1158839228, now seen corresponding path program 12 times [2024-10-24 01:07:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:50,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482922814] [2024-10-24 01:07:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:50,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:50,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:50,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:50,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:50,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:51,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:51,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:51,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:51,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-24 01:07:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:07:51,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482922814] [2024-10-24 01:07:51,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482922814] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:07:51,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428454041] [2024-10-24 01:07:51,159 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-24 01:07:51,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:07:51,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:07:51,161 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:07:51,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-24 01:07:51,522 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-10-24 01:07:51,523 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:07:51,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 01:07:51,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:07:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-24 01:07:51,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:07:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-24 01:07:58,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428454041] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:07:58,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:07:58,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 32 [2024-10-24 01:07:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576042067] [2024-10-24 01:07:58,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:07:58,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-24 01:07:58,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:07:58,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-24 01:07:58,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2024-10-24 01:07:58,737 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 32 states, 30 states have (on average 2.066666666666667) internal successors, (62), 31 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2024-10-24 01:07:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:07:58,917 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2024-10-24 01:07:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:07:58,918 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.066666666666667) internal successors, (62), 31 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) Word has length 81 [2024-10-24 01:07:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:07:58,918 INFO L225 Difference]: With dead ends: 54 [2024-10-24 01:07:58,918 INFO L226 Difference]: Without dead ends: 50 [2024-10-24 01:07:58,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 158 SyntacticMatches, 13 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=606, Invalid=1286, Unknown=0, NotChecked=0, Total=1892 [2024-10-24 01:07:58,920 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 77 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:07:58,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 77 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:07:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-24 01:07:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-24 01:07:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 01:07:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2024-10-24 01:07:58,931 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2024-10-24 01:07:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:07:58,931 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-10-24 01:07:58,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.066666666666667) internal successors, (62), 31 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2024-10-24 01:07:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2024-10-24 01:07:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 01:07:58,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:07:58,934 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:07:58,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-24 01:07:59,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-24 01:07:59,134 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:07:59,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:07:59,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1570097358, now seen corresponding path program 13 times [2024-10-24 01:07:59,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:07:59,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014752314] [2024-10-24 01:07:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:07:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:07:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:07:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:07:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:07:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:00,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-24 01:08:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:08:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014752314] [2024-10-24 01:08:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014752314] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:08:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767765674] [2024-10-24 01:08:00,065 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-24 01:08:00,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:08:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:08:00,067 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:08:00,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-24 01:08:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:00,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 01:08:00,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:08:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-24 01:08:00,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:08:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-24 01:08:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767765674] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:08:09,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:08:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 34 [2024-10-24 01:08:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783607977] [2024-10-24 01:08:09,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:08:09,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-24 01:08:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:08:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-24 01:08:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 01:08:09,823 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 34 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2024-10-24 01:08:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:08:09,984 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2024-10-24 01:08:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 01:08:09,985 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) Word has length 87 [2024-10-24 01:08:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:08:09,985 INFO L225 Difference]: With dead ends: 57 [2024-10-24 01:08:09,985 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 01:08:09,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 170 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=694, Invalid=1468, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 01:08:09,986 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 86 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:08:09,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 73 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:08:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 01:08:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-24 01:08:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 01:08:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2024-10-24 01:08:09,991 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2024-10-24 01:08:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:08:09,992 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2024-10-24 01:08:09,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2024-10-24 01:08:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-10-24 01:08:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 01:08:09,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:08:09,993 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:08:10,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-24 01:08:10,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-24 01:08:10,194 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:08:10,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:08:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1407069436, now seen corresponding path program 14 times [2024-10-24 01:08:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:08:10,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405076411] [2024-10-24 01:08:10,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:08:10,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:08:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:08:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:10,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:11,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:11,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:11,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:11,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:08:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:08:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-24 01:08:11,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:08:11,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405076411] [2024-10-24 01:08:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405076411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:08:11,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136044697] [2024-10-24 01:08:11,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 01:08:11,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:08:11,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:08:11,314 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:08:11,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-24 01:08:11,823 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 01:08:11,824 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:08:11,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 01:08:11,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:08:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-24 01:08:11,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:08:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-24 01:08:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136044697] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:08:23,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:08:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2024-10-24 01:08:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204844351] [2024-10-24 01:08:23,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:08:23,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-24 01:08:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:08:23,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-24 01:08:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 01:08:23,188 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-10-24 01:08:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:08:23,373 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2024-10-24 01:08:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 01:08:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) Word has length 93 [2024-10-24 01:08:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:08:23,375 INFO L225 Difference]: With dead ends: 60 [2024-10-24 01:08:23,375 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 01:08:23,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 182 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=785, Invalid=1567, Unknown=0, NotChecked=0, Total=2352 [2024-10-24 01:08:23,376 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:08:23,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 79 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:08:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 01:08:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 01:08:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 01:08:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-10-24 01:08:23,381 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2024-10-24 01:08:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:08:23,382 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-10-24 01:08:23,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-10-24 01:08:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-10-24 01:08:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:08:23,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:08:23,383 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:08:23,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-24 01:08:23,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:08:23,584 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:08:23,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:08:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1758730226, now seen corresponding path program 15 times [2024-10-24 01:08:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:08:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278744424] [2024-10-24 01:08:23,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:08:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:08:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 01:08:23,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 01:08:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 01:08:23,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 01:08:23,658 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 01:08:23,659 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 01:08:23,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:08:23,663 INFO L407 BasicCegarLoop]: Path program histogram: [15, 1] [2024-10-24 01:08:23,714 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 01:08:23,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:08:23 BoogieIcfgContainer [2024-10-24 01:08:23,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 01:08:23,720 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 01:08:23,720 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 01:08:23,720 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 01:08:23,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:07:17" (3/4) ... [2024-10-24 01:08:23,721 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 01:08:23,783 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 01:08:23,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 01:08:23,784 INFO L158 Benchmark]: Toolchain (without parser) took 67254.34ms. Allocated memory was 167.8MB in the beginning and 597.7MB in the end (delta: 429.9MB). Free memory was 97.6MB in the beginning and 315.4MB in the end (delta: -217.8MB). Peak memory consumption was 214.5MB. Max. memory is 16.1GB. [2024-10-24 01:08:23,784 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 01:08:23,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.05ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 85.6MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 01:08:23,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.29ms. Allocated memory is still 167.8MB. Free memory was 85.6MB in the beginning and 84.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 01:08:23,785 INFO L158 Benchmark]: Boogie Preprocessor took 32.82ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 82.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 01:08:23,785 INFO L158 Benchmark]: RCFGBuilder took 337.76ms. Allocated memory is still 167.8MB. Free memory was 82.7MB in the beginning and 133.9MB in the end (delta: -51.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-24 01:08:23,785 INFO L158 Benchmark]: TraceAbstraction took 66549.12ms. Allocated memory was 167.8MB in the beginning and 597.7MB in the end (delta: 429.9MB). Free memory was 132.8MB in the beginning and 318.6MB in the end (delta: -185.8MB). Peak memory consumption was 243.1MB. Max. memory is 16.1GB. [2024-10-24 01:08:23,785 INFO L158 Benchmark]: Witness Printer took 63.82ms. Allocated memory is still 597.7MB. Free memory was 318.6MB in the beginning and 315.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 01:08:23,789 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.16ms. Allocated memory is still 167.8MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.05ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 85.6MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.29ms. Allocated memory is still 167.8MB. Free memory was 85.6MB in the beginning and 84.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.82ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 82.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 337.76ms. Allocated memory is still 167.8MB. Free memory was 82.7MB in the beginning and 133.9MB in the end (delta: -51.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 66549.12ms. Allocated memory was 167.8MB in the beginning and 597.7MB in the end (delta: 429.9MB). Free memory was 132.8MB in the beginning and 318.6MB in the end (delta: -185.8MB). Peak memory consumption was 243.1MB. Max. memory is 16.1GB. * Witness Printer took 63.82ms. Allocated memory is still 597.7MB. Free memory was 318.6MB in the beginning and 315.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 15; [L15] int b = 0; VAL [a=15, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=15, b=0] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.4s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 908 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 758 mSDsluCounter, 814 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 694 mSDsCounter, 298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1200 IncrementalHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 298 mSolverCounterUnsat, 120 mSDtfsCounter, 1200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 1458 SyntacticMatches, 120 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5366 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=15, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 58.4s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 2234 ConstructedInterpolants, 0 QuantifiedInterpolants, 6624 SizeOfPredicates, 105 NumberOfNonLiveVariables, 2562 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 3710/9450 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 01:08:23,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE