./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/Ackermann04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:01:45,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:01:45,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:01:45,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:01:45,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:01:45,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:01:45,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:01:45,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:01:45,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:01:45,247 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:01:45,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:01:45,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:01:45,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:01:45,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:01:45,250 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:01:45,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:01:45,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:01:45,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:01:45,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:01:45,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:01:45,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:01:45,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:01:45,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:01:45,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:01:45,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:01:45,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:01:45,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:01:45,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:01:45,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:01:45,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:01:45,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:01:45,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:01:45,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:01:45,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:01:45,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:01:45,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:01:45,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:01:45,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:01:45,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:01:45,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:01:45,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:01:45,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:01:45,262 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 [2024-10-11 03:01:45,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:01:45,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:01:45,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:01:45,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:01:45,580 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:01:45,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c [2024-10-11 03:01:47,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:01:47,265 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:01:47,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c [2024-10-11 03:01:47,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/16c2b4835/62f87067f6c64254afd3cc5cf3be3cb4/FLAG0e4ffa8f5 [2024-10-11 03:01:47,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/16c2b4835/62f87067f6c64254afd3cc5cf3be3cb4 [2024-10-11 03:01:47,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:01:47,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:01:47,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:01:47,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:01:47,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:01:47,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7812fe13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47, skipping insertion in model container [2024-10-11 03:01:47,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:01:47,492 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/Ackermann04.c[1166,1179] [2024-10-11 03:01:47,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:01:47,507 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:01:47,523 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/Ackermann04.c[1166,1179] [2024-10-11 03:01:47,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:01:47,546 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:01:47,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47 WrapperNode [2024-10-11 03:01:47,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:01:47,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:01:47,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:01:47,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:01:47,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,578 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2024-10-11 03:01:47,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:01:47,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:01:47,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:01:47,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:01:47,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,605 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:01:47,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:01:47,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:01:47,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:01:47,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:01:47,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (1/1) ... [2024-10-11 03:01:47,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:01:47,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:47,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:01:47,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:01:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:01:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:01:47,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:01:47,715 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2024-10-11 03:01:47,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2024-10-11 03:01:47,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:01:47,783 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:01:47,785 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:01:47,974 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 03:01:47,974 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:01:47,995 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:01:47,995 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:01:47,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:01:47 BoogieIcfgContainer [2024-10-11 03:01:47,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:01:47,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:01:47,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:01:48,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:01:48,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:01:47" (1/3) ... [2024-10-11 03:01:48,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132db10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:01:48, skipping insertion in model container [2024-10-11 03:01:48,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:47" (2/3) ... [2024-10-11 03:01:48,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132db10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:01:48, skipping insertion in model container [2024-10-11 03:01:48,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:01:47" (3/3) ... [2024-10-11 03:01:48,009 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2024-10-11 03:01:48,024 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:01:48,025 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:01:48,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:01:48,088 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;@6f80f650, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:01:48,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:01:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 03:01:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 03:01:48,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:48,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:01:48,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:48,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1538870455, now seen corresponding path program 1 times [2024-10-11 03:01:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:48,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602639499] [2024-10-11 03:01:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:01:48,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:48,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602639499] [2024-10-11 03:01:48,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602639499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:01:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:01:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:01:48,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350777497] [2024-10-11 03:01:48,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:01:48,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:01:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:48,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:01:48,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:01:48,464 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:01:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:48,618 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2024-10-11 03:01:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:01:48,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-10-11 03:01:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:48,628 INFO L225 Difference]: With dead ends: 47 [2024-10-11 03:01:48,629 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 03:01:48,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:01:48,635 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:48,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 57 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:01:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 03:01:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-11 03:01:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 03:01:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-11 03:01:48,677 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2024-10-11 03:01:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:48,678 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-11 03:01:48,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:01:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-11 03:01:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 03:01:48,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:48,680 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:01:48,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:01:48,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:48,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:48,681 INFO L85 PathProgramCache]: Analyzing trace with hash -108557995, now seen corresponding path program 1 times [2024-10-11 03:01:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:48,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610476174] [2024-10-11 03:01:48,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:48,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:01:48,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:48,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610476174] [2024-10-11 03:01:48,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610476174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:01:48,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246058768] [2024-10-11 03:01:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:48,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:48,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:48,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:01:48,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:01:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 03:01:48,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:01:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:01:49,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:01:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:01:49,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246058768] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:01:49,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:01:49,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 03:01:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433766470] [2024-10-11 03:01:49,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:01:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:01:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:49,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:01:49,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:01:49,125 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 03:01:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:49,336 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2024-10-11 03:01:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:01:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 18 [2024-10-11 03:01:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:49,340 INFO L225 Difference]: With dead ends: 79 [2024-10-11 03:01:49,340 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 03:01:49,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:01:49,343 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:49,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 96 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:01:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 03:01:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-10-11 03:01:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27) [2024-10-11 03:01:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2024-10-11 03:01:49,362 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 18 [2024-10-11 03:01:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:49,363 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2024-10-11 03:01:49,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 03:01:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2024-10-11 03:01:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 03:01:49,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:49,367 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:01:49,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:01:49,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:49,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:49,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:49,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1262121361, now seen corresponding path program 1 times [2024-10-11 03:01:49,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:49,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317618942] [2024-10-11 03:01:49,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:49,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:49,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:49,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:49,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:49,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:50,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:50,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:01:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 03:01:50,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:50,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317618942] [2024-10-11 03:01:50,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317618942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:01:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536743782] [2024-10-11 03:01:50,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:50,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:50,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:50,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:01:50,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:01:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:50,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:01:50,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:01:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 03:01:50,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:01:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 03:01:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536743782] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:01:50,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:01:50,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-10-11 03:01:50,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382222719] [2024-10-11 03:01:50,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:01:50,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:01:50,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:50,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:01:50,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:01:50,805 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 03:01:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:50,961 INFO L93 Difference]: Finished difference Result 119 states and 226 transitions. [2024-10-11 03:01:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:01:50,962 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) Word has length 44 [2024-10-11 03:01:50,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:50,964 INFO L225 Difference]: With dead ends: 119 [2024-10-11 03:01:50,965 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 03:01:50,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:01:50,968 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:50,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 77 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:01:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 03:01:50,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 03:01:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2024-10-11 03:01:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-10-11 03:01:50,986 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 44 [2024-10-11 03:01:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:50,987 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-10-11 03:01:50,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 03:01:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-10-11 03:01:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:01:50,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:50,991 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:01:51,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:01:51,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:51,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:51,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:51,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1396423690, now seen corresponding path program 2 times [2024-10-11 03:01:51,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:51,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209429086] [2024-10-11 03:01:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:01:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 03:01:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-11 03:01:51,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209429086] [2024-10-11 03:01:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209429086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:01:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497864427] [2024-10-11 03:01:51,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:01:51,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:51,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:51,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:01:51,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:01:51,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:01:51,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:01:51,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 03:01:51,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:01:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-11 03:01:51,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:01:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-11 03:01:53,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497864427] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:01:53,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:01:53,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2024-10-11 03:01:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998082477] [2024-10-11 03:01:53,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:01:53,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 03:01:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 03:01:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:01:53,544 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2024-10-11 03:01:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:54,038 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2024-10-11 03:01:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 03:01:54,039 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) Word has length 78 [2024-10-11 03:01:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:54,041 INFO L225 Difference]: With dead ends: 118 [2024-10-11 03:01:54,042 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 03:01:54,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1599, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 03:01:54,046 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:54,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 135 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:01:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 03:01:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2024-10-11 03:01:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2024-10-11 03:01:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-11 03:01:54,066 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 78 [2024-10-11 03:01:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:54,067 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-11 03:01:54,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2024-10-11 03:01:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-11 03:01:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 03:01:54,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:54,073 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 17, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:01:54,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 03:01:54,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:54,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:54,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:54,274 INFO L85 PathProgramCache]: Analyzing trace with hash -449528186, now seen corresponding path program 3 times [2024-10-11 03:01:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793860183] [2024-10-11 03:01:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:54,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:54,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:54,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:54,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:54,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:54,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:01:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:01:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:01:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:01:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:01:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 259 proven. 381 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2024-10-11 03:01:55,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:55,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793860183] [2024-10-11 03:01:55,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793860183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:01:55,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433365136] [2024-10-11 03:01:55,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:01:55,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:55,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:55,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:01:55,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:01:55,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-11 03:01:55,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:01:55,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 03:01:55,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:01:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 572 proven. 22 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2024-10-11 03:01:55,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:01:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 572 proven. 30 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2024-10-11 03:01:56,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433365136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:01:56,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:01:56,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2024-10-11 03:01:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632016729] [2024-10-11 03:01:56,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:01:56,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 03:01:56,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:56,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 03:01:56,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:01:56,562 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 9 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (21), 6 states have call predecessors, (21), 9 states have call successors, (21) [2024-10-11 03:01:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:56,708 INFO L93 Difference]: Finished difference Result 112 states and 189 transitions. [2024-10-11 03:01:56,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:01:56,709 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 9 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (21), 6 states have call predecessors, (21), 9 states have call successors, (21) Word has length 184 [2024-10-11 03:01:56,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:56,711 INFO L225 Difference]: With dead ends: 112 [2024-10-11 03:01:56,711 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 03:01:56,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 410 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:01:56,713 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:56,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:01:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 03:01:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2024-10-11 03:01:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (25), 11 states have call predecessors, (25), 9 states have call successors, (25) [2024-10-11 03:01:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-10-11 03:01:56,726 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 184 [2024-10-11 03:01:56,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:56,729 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-10-11 03:01:56,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 9 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (21), 6 states have call predecessors, (21), 9 states have call successors, (21) [2024-10-11 03:01:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-10-11 03:01:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 03:01:56,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:56,732 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:01:56,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:01:56,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:56,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:56,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1363865912, now seen corresponding path program 4 times [2024-10-11 03:01:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:56,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421614824] [2024-10-11 03:01:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:56,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:01:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 03:01:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:01:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:01:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 125 proven. 275 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-11 03:01:57,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:57,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421614824] [2024-10-11 03:01:57,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421614824] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:01:57,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866283647] [2024-10-11 03:01:57,603 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 03:01:57,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:57,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:57,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:01:57,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:01:57,721 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 03:01:57,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:01:57,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 03:01:57,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:01:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 484 proven. 71 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-11 03:01:57,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:01:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 131 proven. 269 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-11 03:01:59,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866283647] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:01:59,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:01:59,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 27 [2024-10-11 03:01:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413093871] [2024-10-11 03:01:59,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:01:59,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 03:01:59,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:59,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 03:01:59,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2024-10-11 03:01:59,238 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 22 states have internal predecessors, (69), 11 states have call successors, (17), 2 states have call predecessors, (17), 12 states have return successors, (27), 13 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-11 03:01:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:59,781 INFO L93 Difference]: Finished difference Result 120 states and 193 transitions. [2024-10-11 03:01:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 03:01:59,782 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 22 states have internal predecessors, (69), 11 states have call successors, (17), 2 states have call predecessors, (17), 12 states have return successors, (27), 13 states have call predecessors, (27), 11 states have call successors, (27) Word has length 130 [2024-10-11 03:01:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:59,785 INFO L225 Difference]: With dead ends: 120 [2024-10-11 03:01:59,785 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 03:01:59,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 281 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=487, Invalid=1865, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 03:01:59,790 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:59,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 193 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:01:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 03:01:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2024-10-11 03:01:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) [2024-10-11 03:01:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2024-10-11 03:01:59,805 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 130 [2024-10-11 03:01:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:59,805 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2024-10-11 03:01:59,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 22 states have internal predecessors, (69), 11 states have call successors, (17), 2 states have call predecessors, (17), 12 states have return successors, (27), 13 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-11 03:01:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2024-10-11 03:01:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 03:01:59,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:59,807 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:01:59,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 03:02:00,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:00,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:00,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:00,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1090473022, now seen corresponding path program 5 times [2024-10-11 03:02:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:00,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327338975] [2024-10-11 03:02:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:00,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:02:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:02:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:02:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:02:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 152 proven. 295 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-10-11 03:02:00,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:00,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327338975] [2024-10-11 03:02:00,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327338975] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:00,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297747991] [2024-10-11 03:02:00,644 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 03:02:00,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:00,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:00,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:00,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:02:00,770 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-11 03:02:00,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:00,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 03:02:00,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-10-11 03:02:00,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 155 proven. 295 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-10-11 03:02:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297747991] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:02,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 17] total 24 [2024-10-11 03:02:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852590646] [2024-10-11 03:02:02,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:02,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 03:02:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:02,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 03:02:02,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:02:02,565 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 21 states have internal predecessors, (70), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2024-10-11 03:02:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:03,050 INFO L93 Difference]: Finished difference Result 134 states and 211 transitions. [2024-10-11 03:02:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 03:02:03,050 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 21 states have internal predecessors, (70), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) Word has length 130 [2024-10-11 03:02:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:03,052 INFO L225 Difference]: With dead ends: 134 [2024-10-11 03:02:03,052 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 03:02:03,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 280 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=455, Invalid=1707, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 03:02:03,054 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:03,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 208 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:02:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 03:02:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-10-11 03:02:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 12 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (32), 15 states have call predecessors, (32), 12 states have call successors, (32) [2024-10-11 03:02:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2024-10-11 03:02:03,065 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 130 [2024-10-11 03:02:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:03,065 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2024-10-11 03:02:03,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 21 states have internal predecessors, (70), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2024-10-11 03:02:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2024-10-11 03:02:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:02:03,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:03,067 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:03,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 03:02:03,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 03:02:03,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:03,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:03,272 INFO L85 PathProgramCache]: Analyzing trace with hash -511219076, now seen corresponding path program 6 times [2024-10-11 03:02:03,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:03,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355231037] [2024-10-11 03:02:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:03,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:03,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:03,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:03,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:03,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:02:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:02:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:02:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:02:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:02:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:02:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 445 proven. 284 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2024-10-11 03:02:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355231037] [2024-10-11 03:02:04,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355231037] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050412985] [2024-10-11 03:02:04,427 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 03:02:04,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:04,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:04,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:02:04,629 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2024-10-11 03:02:04,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:04,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 03:02:04,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2024-10-11 03:02:04,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-10-11 03:02:08,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050412985] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:08,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:08,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 27] total 38 [2024-10-11 03:02:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431402233] [2024-10-11 03:02:08,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:08,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 03:02:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:08,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 03:02:08,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 03:02:08,693 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2024-10-11 03:02:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:09,412 INFO L93 Difference]: Finished difference Result 154 states and 245 transitions. [2024-10-11 03:02:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-11 03:02:09,413 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) Word has length 156 [2024-10-11 03:02:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:09,415 INFO L225 Difference]: With dead ends: 154 [2024-10-11 03:02:09,416 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 03:02:09,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 331 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=874, Invalid=3818, Unknown=0, NotChecked=0, Total=4692 [2024-10-11 03:02:09,419 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 76 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:09,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 257 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:02:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 03:02:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-10-11 03:02:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 14 states have call successors, (14), 6 states have call predecessors, (14), 12 states have return successors, (43), 19 states have call predecessors, (43), 14 states have call successors, (43) [2024-10-11 03:02:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2024-10-11 03:02:09,444 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 156 [2024-10-11 03:02:09,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:09,445 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2024-10-11 03:02:09,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2024-10-11 03:02:09,445 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2024-10-11 03:02:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 03:02:09,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:09,447 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:09,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 03:02:09,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:09,649 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:09,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:09,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2140695240, now seen corresponding path program 7 times [2024-10-11 03:02:09,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:09,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422040636] [2024-10-11 03:02:09,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:09,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:02:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:02:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:02:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:02:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:02:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:02:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:02:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:02:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 686 proven. 70 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2024-10-11 03:02:10,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:10,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422040636] [2024-10-11 03:02:10,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422040636] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:10,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129164941] [2024-10-11 03:02:10,826 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 03:02:10,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:10,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:10,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:10,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 03:02:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:11,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 03:02:11,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2024-10-11 03:02:11,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 711 proven. 75 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-10-11 03:02:17,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129164941] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:17,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:17,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 38 [2024-10-11 03:02:17,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551427440] [2024-10-11 03:02:17,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:17,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 03:02:17,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:17,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 03:02:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 03:02:17,581 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2024-10-11 03:02:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:18,736 INFO L93 Difference]: Finished difference Result 133 states and 215 transitions. [2024-10-11 03:02:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 03:02:18,736 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) Word has length 182 [2024-10-11 03:02:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:18,738 INFO L225 Difference]: With dead ends: 133 [2024-10-11 03:02:18,738 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 03:02:18,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 389 SyntacticMatches, 20 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1027, Invalid=4673, Unknown=0, NotChecked=0, Total=5700 [2024-10-11 03:02:18,741 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 61 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:18,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 229 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:02:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 03:02:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2024-10-11 03:02:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.096774193548387) internal successors, (68), 63 states have internal predecessors, (68), 15 states have call successors, (15), 6 states have call predecessors, (15), 16 states have return successors, (64), 24 states have call predecessors, (64), 15 states have call successors, (64) [2024-10-11 03:02:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2024-10-11 03:02:18,762 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 182 [2024-10-11 03:02:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:18,763 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2024-10-11 03:02:18,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2024-10-11 03:02:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2024-10-11 03:02:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 03:02:18,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:02:18,765 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:02:18,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 03:02:18,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:18,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:02:18,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:02:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1922447937, now seen corresponding path program 8 times [2024-10-11 03:02:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:02:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201998490] [2024-10-11 03:02:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:02:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:02:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:02:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:02:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:02:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:02:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:02:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:02:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:02:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:02:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:02:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:02:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 502 proven. 372 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2024-10-11 03:02:20,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:02:20,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201998490] [2024-10-11 03:02:20,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201998490] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:02:20,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652635227] [2024-10-11 03:02:20,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:02:20,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:20,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:02:20,034 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:02:20,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 03:02:20,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:02:20,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:02:20,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 03:02:20,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:02:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-11 03:02:20,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:02:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-10-11 03:02:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652635227] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:02:24,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:02:24,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 28] total 35 [2024-10-11 03:02:24,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776117214] [2024-10-11 03:02:24,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:02:24,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 03:02:24,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:02:24,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 03:02:24,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 03:02:24,272 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 35 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2024-10-11 03:02:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:02:24,988 INFO L93 Difference]: Finished difference Result 190 states and 340 transitions. [2024-10-11 03:02:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-11 03:02:24,989 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 169 [2024-10-11 03:02:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:02:24,990 INFO L225 Difference]: With dead ends: 190 [2024-10-11 03:02:24,990 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:02:24,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 360 SyntacticMatches, 19 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=993, Invalid=3977, Unknown=0, NotChecked=0, Total=4970 [2024-10-11 03:02:24,993 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 110 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:02:24,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 171 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:02:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:02:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:02:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:02:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:02:24,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2024-10-11 03:02:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:02:24,996 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:02:24,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2024-10-11 03:02:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:02:24,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:02:24,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:02:25,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 03:02:25,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:02:25,204 INFO L407 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2024-10-11 03:02:25,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:02:28,316 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:02:28,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:02:28 BoogieIcfgContainer [2024-10-11 03:02:28,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:02:28,347 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:02:28,347 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:02:28,347 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:02:28,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:01:47" (3/4) ... [2024-10-11 03:02:28,350 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:02:28,354 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2024-10-11 03:02:28,357 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 03:02:28,358 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 03:02:28,358 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 03:02:28,358 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:02:28,445 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:02:28,446 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:02:28,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:02:28,447 INFO L158 Benchmark]: Toolchain (without parser) took 41158.83ms. Allocated memory was 165.7MB in the beginning and 599.8MB in the end (delta: 434.1MB). Free memory was 132.7MB in the beginning and 251.0MB in the end (delta: -118.3MB). Peak memory consumption was 314.9MB. Max. memory is 16.1GB. [2024-10-11 03:02:28,447 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:02:28,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.20ms. Allocated memory is still 165.7MB. Free memory was 131.8MB in the beginning and 120.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 03:02:28,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.55ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 119.2MB in the end (delta: 984.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:02:28,448 INFO L158 Benchmark]: Boogie Preprocessor took 41.04ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 117.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:02:28,448 INFO L158 Benchmark]: RCFGBuilder took 376.76ms. Allocated memory is still 165.7MB. Free memory was 117.1MB in the beginning and 133.2MB in the end (delta: -16.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 03:02:28,449 INFO L158 Benchmark]: TraceAbstraction took 40347.45ms. Allocated memory was 165.7MB in the beginning and 599.8MB in the end (delta: 434.1MB). Free memory was 132.2MB in the beginning and 255.2MB in the end (delta: -123.0MB). Peak memory consumption was 367.7MB. Max. memory is 16.1GB. [2024-10-11 03:02:28,449 INFO L158 Benchmark]: Witness Printer took 99.11ms. Allocated memory is still 599.8MB. Free memory was 255.2MB in the beginning and 251.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 03:02:28,450 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.17ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.20ms. Allocated memory is still 165.7MB. Free memory was 131.8MB in the beginning and 120.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.55ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 119.2MB in the end (delta: 984.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.04ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 117.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.76ms. Allocated memory is still 165.7MB. Free memory was 117.1MB in the beginning and 133.2MB in the end (delta: -16.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40347.45ms. Allocated memory was 165.7MB in the beginning and 599.8MB in the end (delta: 434.1MB). Free memory was 132.2MB in the beginning and 255.2MB in the end (delta: -123.0MB). Peak memory consumption was 367.7MB. Max. memory is 16.1GB. * Witness Printer took 99.11ms. Allocated memory is still 599.8MB. Free memory was 255.2MB in the beginning and 251.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.1s, OverallIterations: 10, TraceHistogramMax: 27, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 1535 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1300 mSDsCounter, 583 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4096 IncrementalHoareTripleChecker+Invalid, 4679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 583 mSolverCounterUnsat, 235 mSDtfsCounter, 4096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2819 GetRequests, 2349 SyntacticMatches, 82 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4932 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=9, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 2193 NumberOfCodeBlocks, 2019 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 6182 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2843 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 20441/24648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 16]: Procedure Contract for ackermann Derived contract for procedure ackermann. Ensures: (((((0 < m) || (n < \result)) && (((m == 0) || (n == 0)) || (0 < n))) && ((0 < m) || (m == 0))) && (((((((((((n == 0) && (2 <= \result)) && (m == 1)) || (((m == 1) && (3 <= \result)) && (n <= 1))) || (6 < \result)) || (((4 <= \result) && (n <= 2)) && (m == 1))) || ((n == 0) && (3 <= \result))) || (m < 1)) || (((n <= 3) && (5 <= \result)) && (m == 1))) || ((5 <= \result) && (n <= 1))) || (((n <= 4) && (\result == 6)) && (m == 1)))) RESULT: Ultimate proved your program to be correct! [2024-10-11 03:02:28,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE