./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label33.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aec3d6b735697765f122fd4969787ab3e5c22f1789977e4ce823d6b216b50af2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:26:26,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:26:26,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:26:26,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:26:26,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:26:26,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:26:26,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:26:26,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:26:26,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:26:26,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:26:26,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:26:26,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:26:26,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:26:26,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:26:26,364 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:26:26,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:26:26,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:26:26,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:26:26,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:26:26,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:26:26,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:26:26,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:26:26,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:26:26,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:26:26,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:26:26,368 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:26:26,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:26:26,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:26:26,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:26:26,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:26:26,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:26:26,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:26:26,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:26:26,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:26:26,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:26:26,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:26:26,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:26:26,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:26:26,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:26:26,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:26:26,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:26:26,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:26:26,373 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aec3d6b735697765f122fd4969787ab3e5c22f1789977e4ce823d6b216b50af2 [2024-11-08 11:26:26,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:26:26,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:26:26,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:26:26,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:26:26,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:26:26,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label33.c [2024-11-08 11:26:27,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:26:28,041 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:26:28,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label33.c [2024-11-08 11:26:28,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae4a1182/8f19ad73fd1c4889a8a5f99b0bfc6d7c/FLAG9dc0a6b73 [2024-11-08 11:26:28,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae4a1182/8f19ad73fd1c4889a8a5f99b0bfc6d7c [2024-11-08 11:26:28,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:26:28,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:26:28,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:26:28,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:26:28,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:26:28,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534bda38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28, skipping insertion in model container [2024-11-08 11:26:28,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:26:28,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label33.c[5937,5950] [2024-11-08 11:26:28,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:26:28,425 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:26:28,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label33.c[5937,5950] [2024-11-08 11:26:28,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:26:28,508 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:26:28,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28 WrapperNode [2024-11-08 11:26:28,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:26:28,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:26:28,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:26:28,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:26:28,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,575 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-11-08 11:26:28,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:26:28,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:26:28,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:26:28,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:26:28,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,618 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:26:28,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:26:28,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:26:28,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:26:28,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:26:28,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (1/1) ... [2024-11-08 11:26:28,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:26:28,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:28,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:26:28,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:26:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:26:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:26:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:26:28,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:26:28,793 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:26:28,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:26:29,603 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-08 11:26:29,604 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:26:29,623 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:26:29,623 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:26:29,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:29 BoogieIcfgContainer [2024-11-08 11:26:29,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:26:29,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:26:29,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:26:29,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:26:29,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:26:28" (1/3) ... [2024-11-08 11:26:29,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e7ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:26:29, skipping insertion in model container [2024-11-08 11:26:29,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:28" (2/3) ... [2024-11-08 11:26:29,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e7ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:26:29, skipping insertion in model container [2024-11-08 11:26:29,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:29" (3/3) ... [2024-11-08 11:26:29,633 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label33.c [2024-11-08 11:26:29,645 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:26:29,645 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:26:29,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:26:29,710 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;@16a958a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:26:29,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:26:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 11:26:29,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:29,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:29,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:29,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2024-11-08 11:26:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:29,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178707865] [2024-11-08 11:26:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:26:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178707865] [2024-11-08 11:26:30,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178707865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:30,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:30,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:26:30,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757300853] [2024-11-08 11:26:30,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:30,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:30,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:30,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:30,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:30,095 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 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) Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:30,818 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2024-11-08 11:26:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 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) Word has length 58 [2024-11-08 11:26:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:30,832 INFO L225 Difference]: With dead ends: 669 [2024-11-08 11:26:30,832 INFO L226 Difference]: Without dead ends: 360 [2024-11-08 11:26:30,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:30,841 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:30,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 94 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:26:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-08 11:26:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-11-08 11:26:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5208913649025069) internal successors, (546), 359 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2024-11-08 11:26:30,893 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 58 [2024-11-08 11:26:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:30,894 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2024-11-08 11:26:30,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2024-11-08 11:26:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 11:26:30,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:30,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:30,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:26:30,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:30,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash 729196247, now seen corresponding path program 1 times [2024-11-08 11:26:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:30,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463568619] [2024-11-08 11:26:30,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:26:31,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:31,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463568619] [2024-11-08 11:26:31,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463568619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:31,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:31,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:26:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163992896] [2024-11-08 11:26:31,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:31,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:31,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:31,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:31,069 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:31,617 INFO L93 Difference]: Finished difference Result 1074 states and 1633 transitions. [2024-11-08 11:26:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:31,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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) Word has length 133 [2024-11-08 11:26:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:31,621 INFO L225 Difference]: With dead ends: 1074 [2024-11-08 11:26:31,622 INFO L226 Difference]: Without dead ends: 716 [2024-11-08 11:26:31,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:31,625 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:31,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 95 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:26:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-08 11:26:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2024-11-08 11:26:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2024-11-08 11:26:31,660 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 133 [2024-11-08 11:26:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:31,661 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2024-11-08 11:26:31,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2024-11-08 11:26:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 11:26:31,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:31,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:31,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:26:31,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:31,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:31,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1708937139, now seen corresponding path program 1 times [2024-11-08 11:26:31,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:31,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008475726] [2024-11-08 11:26:31,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:31,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:26:31,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:31,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008475726] [2024-11-08 11:26:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008475726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:31,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:31,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:31,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120864063] [2024-11-08 11:26:31,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:31,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:26:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:31,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:26:31,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:26:31,885 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:32,629 INFO L93 Difference]: Finished difference Result 1964 states and 2570 transitions. [2024-11-08 11:26:32,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:26:32,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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) Word has length 137 [2024-11-08 11:26:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:32,633 INFO L225 Difference]: With dead ends: 1964 [2024-11-08 11:26:32,633 INFO L226 Difference]: Without dead ends: 1250 [2024-11-08 11:26:32,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:26:32,635 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:32,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:26:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-08 11:26:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2024-11-08 11:26:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.2361889511609288) internal successors, (1544), 1249 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1544 transitions. [2024-11-08 11:26:32,656 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1544 transitions. Word has length 137 [2024-11-08 11:26:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:32,657 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1544 transitions. [2024-11-08 11:26:32,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:32,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1544 transitions. [2024-11-08 11:26:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 11:26:32,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:32,666 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:32,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:26:32,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:32,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:32,669 INFO L85 PathProgramCache]: Analyzing trace with hash -916192095, now seen corresponding path program 1 times [2024-11-08 11:26:32,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:32,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402284041] [2024-11-08 11:26:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:32,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 11:26:32,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402284041] [2024-11-08 11:26:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402284041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:32,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:32,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:32,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52339080] [2024-11-08 11:26:32,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:32,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:26:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:26:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:26:32,885 INFO L87 Difference]: Start difference. First operand 1250 states and 1544 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:33,491 INFO L93 Difference]: Finished difference Result 2705 states and 3353 transitions. [2024-11-08 11:26:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:26:33,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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) Word has length 217 [2024-11-08 11:26:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:33,498 INFO L225 Difference]: With dead ends: 2705 [2024-11-08 11:26:33,498 INFO L226 Difference]: Without dead ends: 1606 [2024-11-08 11:26:33,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:26:33,501 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:33,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:26:33,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2024-11-08 11:26:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2024-11-08 11:26:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1221183800623054) internal successors, (1801), 1605 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1801 transitions. [2024-11-08 11:26:33,523 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1801 transitions. Word has length 217 [2024-11-08 11:26:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:33,524 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1801 transitions. [2024-11-08 11:26:33,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1801 transitions. [2024-11-08 11:26:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-08 11:26:33,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:33,527 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:33,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:26:33,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:33,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:33,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1467709680, now seen corresponding path program 1 times [2024-11-08 11:26:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:33,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091847448] [2024-11-08 11:26:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:33,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 215 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:26:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091847448] [2024-11-08 11:26:33,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091847448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:26:33,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243169777] [2024-11-08 11:26:33,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:33,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:33,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:33,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:26:33,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:26:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:34,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:26:34,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:26:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-08 11:26:34,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:26:34,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243169777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:34,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:26:34,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:26:34,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554713391] [2024-11-08 11:26:34,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:34,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:34,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:26:34,112 INFO L87 Difference]: Start difference. First operand 1606 states and 1801 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:34,568 INFO L93 Difference]: Finished difference Result 3388 states and 3901 transitions. [2024-11-08 11:26:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:34,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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) Word has length 344 [2024-11-08 11:26:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:34,574 INFO L225 Difference]: With dead ends: 3388 [2024-11-08 11:26:34,574 INFO L226 Difference]: Without dead ends: 1962 [2024-11-08 11:26:34,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:26:34,576 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 127 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:34,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 254 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:26:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-08 11:26:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2024-11-08 11:26:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.1320754716981132) internal successors, (2220), 1961 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2220 transitions. [2024-11-08 11:26:34,598 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2220 transitions. Word has length 344 [2024-11-08 11:26:34,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:34,598 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2220 transitions. [2024-11-08 11:26:34,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2220 transitions. [2024-11-08 11:26:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-08 11:26:34,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:34,601 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:34,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 11:26:34,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:34,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:34,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1261449754, now seen corresponding path program 1 times [2024-11-08 11:26:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:34,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327366482] [2024-11-08 11:26:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-08 11:26:35,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:35,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327366482] [2024-11-08 11:26:35,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327366482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:35,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:35,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:35,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657520510] [2024-11-08 11:26:35,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:35,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:35,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:35,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:35,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:35,101 INFO L87 Difference]: Start difference. First operand 1962 states and 2220 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:35,530 INFO L93 Difference]: Finished difference Result 4100 states and 4689 transitions. [2024-11-08 11:26:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:35,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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) Word has length 348 [2024-11-08 11:26:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:35,537 INFO L225 Difference]: With dead ends: 4100 [2024-11-08 11:26:35,537 INFO L226 Difference]: Without dead ends: 2318 [2024-11-08 11:26:35,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:35,540 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 101 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:35,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 58 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:26:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-08 11:26:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2024-11-08 11:26:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.127751402675874) internal successors, (2613), 2317 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2613 transitions. [2024-11-08 11:26:35,571 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2613 transitions. Word has length 348 [2024-11-08 11:26:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:35,572 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2613 transitions. [2024-11-08 11:26:35,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2613 transitions. [2024-11-08 11:26:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-08 11:26:35,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:35,575 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:35,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:26:35,575 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:35,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1867847128, now seen corresponding path program 1 times [2024-11-08 11:26:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26617473] [2024-11-08 11:26:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 222 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 11:26:35,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:35,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26617473] [2024-11-08 11:26:35,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26617473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:26:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700501259] [2024-11-08 11:26:35,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:35,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:35,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:35,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:26:35,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:26:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:35,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:26:35,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:26:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-11-08 11:26:36,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:26:36,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700501259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:36,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:26:36,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-08 11:26:36,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433477331] [2024-11-08 11:26:36,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:36,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:36,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:36,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:26:36,272 INFO L87 Difference]: Start difference. First operand 2318 states and 2613 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:36,700 INFO L93 Difference]: Finished difference Result 4990 states and 5718 transitions. [2024-11-08 11:26:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:36,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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) Word has length 351 [2024-11-08 11:26:36,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:36,707 INFO L225 Difference]: With dead ends: 4990 [2024-11-08 11:26:36,707 INFO L226 Difference]: Without dead ends: 2852 [2024-11-08 11:26:36,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:26:36,710 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:36,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:26:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2024-11-08 11:26:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2024-11-08 11:26:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.1126075570520015) internal successors, (2974), 2673 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2974 transitions. [2024-11-08 11:26:36,739 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2974 transitions. Word has length 351 [2024-11-08 11:26:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:36,740 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2974 transitions. [2024-11-08 11:26:36,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2974 transitions. [2024-11-08 11:26:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-08 11:26:36,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:36,743 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-11-08 11:26:36,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:26:36,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 11:26:36,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:36,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:36,949 INFO L85 PathProgramCache]: Analyzing trace with hash -814875796, now seen corresponding path program 1 times [2024-11-08 11:26:36,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:36,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44614991] [2024-11-08 11:26:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:36,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 11:26:37,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:37,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44614991] [2024-11-08 11:26:37,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44614991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:26:37,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953687908] [2024-11-08 11:26:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:37,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:37,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:37,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:26:37,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:26:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:37,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:26:37,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:26:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 11:26:37,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:26:37,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953687908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:37,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:26:37,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 11:26:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607975168] [2024-11-08 11:26:37,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:37,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:37,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:37,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:26:37,386 INFO L87 Difference]: Start difference. First operand 2674 states and 2974 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:37,824 INFO L93 Difference]: Finished difference Result 5702 states and 6438 transitions. [2024-11-08 11:26:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:37,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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) Word has length 375 [2024-11-08 11:26:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:37,831 INFO L225 Difference]: With dead ends: 5702 [2024-11-08 11:26:37,831 INFO L226 Difference]: Without dead ends: 3208 [2024-11-08 11:26:37,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:26:37,836 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:37,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 67 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:26:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2024-11-08 11:26:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2024-11-08 11:26:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.1164503682918274) internal successors, (3183), 2851 states have internal predecessors, (3183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:37,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3183 transitions. [2024-11-08 11:26:37,867 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3183 transitions. Word has length 375 [2024-11-08 11:26:37,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:37,870 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3183 transitions. [2024-11-08 11:26:37,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3183 transitions. [2024-11-08 11:26:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-08 11:26:37,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:37,873 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:37,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 11:26:38,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:38,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:38,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash 132656657, now seen corresponding path program 1 times [2024-11-08 11:26:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014441268] [2024-11-08 11:26:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:38,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 11:26:38,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:38,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014441268] [2024-11-08 11:26:38,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014441268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:38,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:38,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:38,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441240377] [2024-11-08 11:26:38,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:38,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:38,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:38,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:38,273 INFO L87 Difference]: Start difference. First operand 2852 states and 3183 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:38,728 INFO L93 Difference]: Finished difference Result 3922 states and 4448 transitions. [2024-11-08 11:26:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:38,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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) Word has length 382 [2024-11-08 11:26:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:38,738 INFO L225 Difference]: With dead ends: 3922 [2024-11-08 11:26:38,738 INFO L226 Difference]: Without dead ends: 3920 [2024-11-08 11:26:38,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:38,739 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:38,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 18 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:26:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2024-11-08 11:26:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3208. [2024-11-08 11:26:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.13844714686623) internal successors, (3651), 3207 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3651 transitions. [2024-11-08 11:26:38,774 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3651 transitions. Word has length 382 [2024-11-08 11:26:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:38,775 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3651 transitions. [2024-11-08 11:26:38,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:38,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3651 transitions. [2024-11-08 11:26:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-11-08 11:26:38,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:38,779 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:38,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:26:38,779 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:38,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1823307718, now seen corresponding path program 1 times [2024-11-08 11:26:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816404219] [2024-11-08 11:26:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-08 11:26:39,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:39,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816404219] [2024-11-08 11:26:39,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816404219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:39,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:39,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380227651] [2024-11-08 11:26:39,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:39,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:26:39,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:39,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:26:39,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:26:39,015 INFO L87 Difference]: Start difference. First operand 3208 states and 3651 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:39,475 INFO L93 Difference]: Finished difference Result 6443 states and 7346 transitions. [2024-11-08 11:26:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:26:39,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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) Word has length 428 [2024-11-08 11:26:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:39,482 INFO L225 Difference]: With dead ends: 6443 [2024-11-08 11:26:39,482 INFO L226 Difference]: Without dead ends: 3386 [2024-11-08 11:26:39,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:26:39,485 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:39,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:26:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2024-11-08 11:26:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3208. [2024-11-08 11:26:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.0994699095728095) internal successors, (3526), 3207 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3526 transitions. [2024-11-08 11:26:39,519 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3526 transitions. Word has length 428 [2024-11-08 11:26:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:39,520 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3526 transitions. [2024-11-08 11:26:39,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3526 transitions. [2024-11-08 11:26:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-11-08 11:26:39,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:39,523 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:39,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:26:39,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:39,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1357227771, now seen corresponding path program 2 times [2024-11-08 11:26:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:39,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824373410] [2024-11-08 11:26:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 473 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-08 11:26:40,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:40,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824373410] [2024-11-08 11:26:40,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824373410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:26:40,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525226498] [2024-11-08 11:26:40,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 11:26:40,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:40,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:40,050 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:26:40,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 11:26:40,160 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 11:26:40,160 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 11:26:40,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:26:40,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:26:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 11:26:40,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:26:40,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525226498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:40,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:26:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:26:40,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532803622] [2024-11-08 11:26:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:40,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:26:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:40,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:26:40,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:26:40,646 INFO L87 Difference]: Start difference. First operand 3208 states and 3526 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:41,141 INFO L93 Difference]: Finished difference Result 7482 states and 8211 transitions. [2024-11-08 11:26:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:26:41,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 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) Word has length 454 [2024-11-08 11:26:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:41,151 INFO L225 Difference]: With dead ends: 7482 [2024-11-08 11:26:41,151 INFO L226 Difference]: Without dead ends: 4454 [2024-11-08 11:26:41,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:26:41,154 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 265 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:41,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 14 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:26:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2024-11-08 11:26:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3208. [2024-11-08 11:26:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.0813844714686622) internal successors, (3468), 3207 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3468 transitions. [2024-11-08 11:26:41,198 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3468 transitions. Word has length 454 [2024-11-08 11:26:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:41,199 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3468 transitions. [2024-11-08 11:26:41,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3468 transitions. [2024-11-08 11:26:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-11-08 11:26:41,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:41,203 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:41,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 11:26:41,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:41,404 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:41,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1022483894, now seen corresponding path program 1 times [2024-11-08 11:26:41,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:41,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81798614] [2024-11-08 11:26:41,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:41,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 11:26:41,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:41,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81798614] [2024-11-08 11:26:41,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81798614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:41,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882318574] [2024-11-08 11:26:41,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:41,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:41,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:41,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:41,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:41,676 INFO L87 Difference]: Start difference. First operand 3208 states and 3468 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:42,034 INFO L93 Difference]: Finished difference Result 6948 states and 7543 transitions. [2024-11-08 11:26:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:42,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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) Word has length 461 [2024-11-08 11:26:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:42,042 INFO L225 Difference]: With dead ends: 6948 [2024-11-08 11:26:42,042 INFO L226 Difference]: Without dead ends: 3920 [2024-11-08 11:26:42,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:42,045 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 103 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:42,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 227 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2024-11-08 11:26:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2024-11-08 11:26:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0751136059877038) internal successors, (4022), 3741 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4022 transitions. [2024-11-08 11:26:42,080 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4022 transitions. Word has length 461 [2024-11-08 11:26:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:42,080 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 4022 transitions. [2024-11-08 11:26:42,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4022 transitions. [2024-11-08 11:26:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2024-11-08 11:26:42,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:42,084 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:42,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:26:42,084 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:42,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1164746627, now seen corresponding path program 1 times [2024-11-08 11:26:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:42,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805560545] [2024-11-08 11:26:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:42,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 473 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-08 11:26:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805560545] [2024-11-08 11:26:42,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805560545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:26:42,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107781233] [2024-11-08 11:26:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:42,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:26:42,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 11:26:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:42,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:26:42,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:26:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-08 11:26:43,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:26:43,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107781233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:43,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:26:43,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-08 11:26:43,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200199841] [2024-11-08 11:26:43,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:43,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:43,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:43,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:26:43,080 INFO L87 Difference]: Start difference. First operand 3742 states and 4022 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:43,374 INFO L93 Difference]: Finished difference Result 8016 states and 8637 transitions. [2024-11-08 11:26:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:43,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 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) Word has length 506 [2024-11-08 11:26:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:43,380 INFO L225 Difference]: With dead ends: 8016 [2024-11-08 11:26:43,380 INFO L226 Difference]: Without dead ends: 4632 [2024-11-08 11:26:43,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:26:43,386 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:43,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 50 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2024-11-08 11:26:43,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4276. [2024-11-08 11:26:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0734502923976608) internal successors, (4589), 4275 states have internal predecessors, (4589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4589 transitions. [2024-11-08 11:26:43,421 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4589 transitions. Word has length 506 [2024-11-08 11:26:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:43,421 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4589 transitions. [2024-11-08 11:26:43,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4589 transitions. [2024-11-08 11:26:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2024-11-08 11:26:43,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:43,425 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:43,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 11:26:43,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 11:26:43,626 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:43,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:43,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1924015763, now seen corresponding path program 1 times [2024-11-08 11:26:43,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:43,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824906650] [2024-11-08 11:26:43,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-08 11:26:43,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:43,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824906650] [2024-11-08 11:26:43,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824906650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:43,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:43,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:43,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271532012] [2024-11-08 11:26:43,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:43,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:43,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:43,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:43,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:43,960 INFO L87 Difference]: Start difference. First operand 4276 states and 4589 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:44,259 INFO L93 Difference]: Finished difference Result 8372 states and 8997 transitions. [2024-11-08 11:26:44,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:44,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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) Word has length 523 [2024-11-08 11:26:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:44,264 INFO L225 Difference]: With dead ends: 8372 [2024-11-08 11:26:44,264 INFO L226 Difference]: Without dead ends: 4276 [2024-11-08 11:26:44,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:44,268 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:44,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2024-11-08 11:26:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3742. [2024-11-08 11:26:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0793905372894947) internal successors, (4038), 3741 states have internal predecessors, (4038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4038 transitions. [2024-11-08 11:26:44,296 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4038 transitions. Word has length 523 [2024-11-08 11:26:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:44,296 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 4038 transitions. [2024-11-08 11:26:44,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4038 transitions. [2024-11-08 11:26:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-11-08 11:26:44,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:44,300 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:44,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:26:44,300 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:44,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:44,300 INFO L85 PathProgramCache]: Analyzing trace with hash -642086955, now seen corresponding path program 1 times [2024-11-08 11:26:44,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:44,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921455723] [2024-11-08 11:26:44,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:44,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 858 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-08 11:26:44,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921455723] [2024-11-08 11:26:44,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921455723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:44,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:44,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:44,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598107125] [2024-11-08 11:26:44,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:44,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:44,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:44,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:44,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:44,492 INFO L87 Difference]: Start difference. First operand 3742 states and 4038 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:44,829 INFO L93 Difference]: Finished difference Result 8372 states and 9091 transitions. [2024-11-08 11:26:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:44,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) Word has length 571 [2024-11-08 11:26:44,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:44,835 INFO L225 Difference]: With dead ends: 8372 [2024-11-08 11:26:44,835 INFO L226 Difference]: Without dead ends: 4810 [2024-11-08 11:26:44,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:44,838 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:44,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 52 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2024-11-08 11:26:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2024-11-08 11:26:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0761072988147224) internal successors, (5175), 4809 states have internal predecessors, (5175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5175 transitions. [2024-11-08 11:26:44,870 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5175 transitions. Word has length 571 [2024-11-08 11:26:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:44,870 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5175 transitions. [2024-11-08 11:26:44,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5175 transitions. [2024-11-08 11:26:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2024-11-08 11:26:44,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:44,876 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:44,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:26:44,876 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:44,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1353804037, now seen corresponding path program 1 times [2024-11-08 11:26:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075163452] [2024-11-08 11:26:44,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 1575 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-11-08 11:26:45,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:45,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075163452] [2024-11-08 11:26:45,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075163452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:45,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:45,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:45,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289460551] [2024-11-08 11:26:45,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:45,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:45,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:45,203 INFO L87 Difference]: Start difference. First operand 4810 states and 5175 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:45,520 INFO L93 Difference]: Finished difference Result 9440 states and 10169 transitions. [2024-11-08 11:26:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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) Word has length 736 [2024-11-08 11:26:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:45,525 INFO L225 Difference]: With dead ends: 9440 [2024-11-08 11:26:45,526 INFO L226 Difference]: Without dead ends: 4810 [2024-11-08 11:26:45,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:45,529 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 102 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:45,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 243 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2024-11-08 11:26:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2024-11-08 11:26:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.068667674368387) internal successors, (4949), 4631 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4949 transitions. [2024-11-08 11:26:45,577 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4949 transitions. Word has length 736 [2024-11-08 11:26:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:45,578 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4949 transitions. [2024-11-08 11:26:45,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4949 transitions. [2024-11-08 11:26:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2024-11-08 11:26:45,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:45,583 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:45,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:26:45,584 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:45,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 195631814, now seen corresponding path program 1 times [2024-11-08 11:26:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:45,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496349610] [2024-11-08 11:26:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 1334 proven. 155 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-08 11:26:45,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496349610] [2024-11-08 11:26:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496349610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:26:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80288953] [2024-11-08 11:26:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:45,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:45,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:45,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:26:45,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 11:26:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:46,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:26:46,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:26:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2024-11-08 11:26:46,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:26:46,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80288953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:46,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:26:46,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 11:26:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554751817] [2024-11-08 11:26:46,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:46,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:46,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:46,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:46,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:26:46,149 INFO L87 Difference]: Start difference. First operand 4632 states and 4949 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:46,426 INFO L93 Difference]: Finished difference Result 6414 states and 6831 transitions. [2024-11-08 11:26:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:46,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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) Word has length 794 [2024-11-08 11:26:46,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:46,433 INFO L225 Difference]: With dead ends: 6414 [2024-11-08 11:26:46,434 INFO L226 Difference]: Without dead ends: 6412 [2024-11-08 11:26:46,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 794 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:26:46,435 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 144 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:46,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 17 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2024-11-08 11:26:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 4632. [2024-11-08 11:26:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.068667674368387) internal successors, (4949), 4631 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4949 transitions. [2024-11-08 11:26:46,471 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4949 transitions. Word has length 794 [2024-11-08 11:26:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:46,471 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4949 transitions. [2024-11-08 11:26:46,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4949 transitions. [2024-11-08 11:26:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2024-11-08 11:26:46,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:46,477 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:46,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 11:26:46,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 11:26:46,678 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:46,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2000356807, now seen corresponding path program 1 times [2024-11-08 11:26:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:46,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256512631] [2024-11-08 11:26:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:46,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 1424 proven. 155 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-08 11:26:47,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256512631] [2024-11-08 11:26:47,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256512631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:26:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573612027] [2024-11-08 11:26:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:47,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:47,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:47,080 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:26:47,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 11:26:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:47,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:26:47,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:26:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2024-11-08 11:26:47,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:26:47,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573612027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:47,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:26:47,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 11:26:47,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565181734] [2024-11-08 11:26:47,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:47,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:47,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:26:47,301 INFO L87 Difference]: Start difference. First operand 4632 states and 4949 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:47,577 INFO L93 Difference]: Finished difference Result 10506 states and 11224 transitions. [2024-11-08 11:26:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:47,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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) Word has length 812 [2024-11-08 11:26:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:47,578 INFO L225 Difference]: With dead ends: 10506 [2024-11-08 11:26:47,578 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:26:47,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 812 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:26:47,584 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 123 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:47,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 238 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:26:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:26:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:26:47,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 812 [2024-11-08 11:26:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:47,585 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:26:47,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:26:47,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:26:47,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:26:47,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 11:26:47,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:47,790 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:47,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:26:48,295 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:26:48,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:26:48 BoogieIcfgContainer [2024-11-08 11:26:48,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:26:48,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:26:48,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:26:48,310 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:26:48,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:29" (3/4) ... [2024-11-08 11:26:48,314 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:26:48,327 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:26:48,328 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:26:48,328 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:26:48,329 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:26:48,441 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:26:48,442 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:26:48,442 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:26:48,442 INFO L158 Benchmark]: Toolchain (without parser) took 20376.34ms. Allocated memory was 144.7MB in the beginning and 662.7MB in the end (delta: 518.0MB). Free memory was 89.1MB in the beginning and 344.2MB in the end (delta: -255.1MB). Peak memory consumption was 264.9MB. Max. memory is 16.1GB. [2024-11-08 11:26:48,442 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 144.7MB. Free memory was 111.3MB in the beginning and 111.3MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:26:48,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.15ms. Allocated memory was 144.7MB in the beginning and 178.3MB in the end (delta: 33.6MB). Free memory was 88.6MB in the beginning and 133.2MB in the end (delta: -44.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-08 11:26:48,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.60ms. Allocated memory is still 178.3MB. Free memory was 133.2MB in the beginning and 123.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 11:26:48,443 INFO L158 Benchmark]: Boogie Preprocessor took 94.01ms. Allocated memory is still 178.3MB. Free memory was 123.8MB in the beginning and 111.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 11:26:48,443 INFO L158 Benchmark]: RCFGBuilder took 950.96ms. Allocated memory is still 178.3MB. Free memory was 110.2MB in the beginning and 81.4MB in the end (delta: 28.7MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-11-08 11:26:48,443 INFO L158 Benchmark]: TraceAbstraction took 18682.62ms. Allocated memory was 178.3MB in the beginning and 662.7MB in the end (delta: 484.4MB). Free memory was 80.4MB in the beginning and 358.9MB in the end (delta: -278.5MB). Peak memory consumption was 341.2MB. Max. memory is 16.1GB. [2024-11-08 11:26:48,444 INFO L158 Benchmark]: Witness Printer took 131.53ms. Allocated memory is still 662.7MB. Free memory was 358.9MB in the beginning and 344.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 11:26:48,448 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.42ms. Allocated memory is still 144.7MB. Free memory was 111.3MB in the beginning and 111.3MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.15ms. Allocated memory was 144.7MB in the beginning and 178.3MB in the end (delta: 33.6MB). Free memory was 88.6MB in the beginning and 133.2MB in the end (delta: -44.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.60ms. Allocated memory is still 178.3MB. Free memory was 133.2MB in the beginning and 123.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.01ms. Allocated memory is still 178.3MB. Free memory was 123.8MB in the beginning and 111.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 950.96ms. Allocated memory is still 178.3MB. Free memory was 110.2MB in the beginning and 81.4MB in the end (delta: 28.7MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18682.62ms. Allocated memory was 178.3MB in the beginning and 662.7MB in the end (delta: 484.4MB). Free memory was 80.4MB in the beginning and 358.9MB in the end (delta: -278.5MB). Peak memory consumption was 341.2MB. Max. memory is 16.1GB. * Witness Printer took 131.53ms. Allocated memory is still 662.7MB. Free memory was 358.9MB in the beginning and 344.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 188]: 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 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 18, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2445 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2445 mSDsluCounter, 1976 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 1161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9042 IncrementalHoareTripleChecker+Invalid, 10203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1161 mSolverCounterUnsat, 1880 mSDtfsCounter, 9042 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3690 GetRequests, 3647 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4810occurred in iteration=15, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 5696 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 11266 NumberOfCodeBlocks, 11266 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 11241 ConstructedInterpolants, 0 QuantifiedInterpolants, 30866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4613 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 19436/20565 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 - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((((((((long long) a12 + 43) <= 0) && (a21 <= 7)) && (a15 <= 5)) || ((7 <= a15) && (a24 == 1))) || (((a12 <= 11) && (a24 == 1)) && (0 <= ((long long) a12 + 42)))) || ((a21 <= 9) && (a24 == 1))) || ((a24 == 1) && (81 <= a12))) || ((a24 == 1) && (a15 <= 5))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:26:48,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE