./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label36.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 f8c7f180e45ffba5eb47ee4dc238e0b48ee8dddec8c88fb0da95366e7d605cc2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:19:30,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:19:30,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:19:30,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:19:30,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:19:30,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:19:30,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:19:30,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:19:30,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:19:30,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:19:30,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:19:30,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:19:30,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:19:30,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:19:30,731 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:19:30,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:19:30,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:19:30,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:19:30,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:19:30,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:19:30,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:19:30,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:19:30,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:19:30,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:19:30,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:19:30,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:19:30,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:19:30,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:19:30,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:19:30,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:19:30,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:19:30,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:19:30,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:19:30,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:19:30,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:19:30,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:19:30,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:19:30,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:19:30,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:19:30,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:19:30,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:19:30,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:19:30,743 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 -> f8c7f180e45ffba5eb47ee4dc238e0b48ee8dddec8c88fb0da95366e7d605cc2 [2024-10-12 16:19:30,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:19:30,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:19:31,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:19:31,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:19:31,001 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:19:31,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2024-10-12 16:19:32,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:19:32,712 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:19:32,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label36.c [2024-10-12 16:19:32,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f2cdd44/25cfa235d3a3406cb025db0e36ce1e01/FLAG15babdac8 [2024-10-12 16:19:32,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f2cdd44/25cfa235d3a3406cb025db0e36ce1e01 [2024-10-12 16:19:32,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:19:32,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:19:32,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:19:32,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:19:32,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:19:32,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:19:32" (1/1) ... [2024-10-12 16:19:32,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e531c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:32, skipping insertion in model container [2024-10-12 16:19:32,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:19:32" (1/1) ... [2024-10-12 16:19:32,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:19:33,114 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label36.c[7434,7447] [2024-10-12 16:19:33,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:19:33,456 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:19:33,486 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label36.c[7434,7447] [2024-10-12 16:19:33,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:19:33,679 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:19:33,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33 WrapperNode [2024-10-12 16:19:33,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:19:33,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:19:33,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:19:33,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:19:33,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:33,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:33,931 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-12 16:19:33,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:19:33,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:19:33,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:19:33,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:19:33,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:33,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:33,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:34,104 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 16:19:34,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:34,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:34,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:34,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:34,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:34,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:34,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:19:34,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:19:34,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:19:34,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:19:34,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (1/1) ... [2024-10-12 16:19:34,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:19:34,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:19:34,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:19:34,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:19:34,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:19:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:19:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:19:34,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:19:34,404 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:19:34,406 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:19:36,619 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-12 16:19:36,619 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:19:36,680 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:19:36,680 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:19:36,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:19:36 BoogieIcfgContainer [2024-10-12 16:19:36,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:19:36,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:19:36,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:19:36,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:19:36,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:19:32" (1/3) ... [2024-10-12 16:19:36,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193e36f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:19:36, skipping insertion in model container [2024-10-12 16:19:36,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:33" (2/3) ... [2024-10-12 16:19:36,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193e36f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:19:36, skipping insertion in model container [2024-10-12 16:19:36,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:19:36" (3/3) ... [2024-10-12 16:19:36,689 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label36.c [2024-10-12 16:19:36,704 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:19:36,705 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:19:36,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:19:36,824 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;@32b7eb7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:19:36,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:19:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 16:19:36,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:36,839 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, 1, 1] [2024-10-12 16:19:36,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:36,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:36,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1101773111, now seen corresponding path program 1 times [2024-10-12 16:19:36,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131908296] [2024-10-12 16:19:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:37,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:37,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131908296] [2024-10-12 16:19:37,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131908296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:37,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:37,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:37,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894446697] [2024-10-12 16:19:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:37,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:19:37,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:37,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:19:37,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:19:37,111 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 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 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:37,179 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-12 16:19:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:19:37,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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 60 [2024-10-12 16:19:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:37,197 INFO L225 Difference]: With dead ends: 723 [2024-10-12 16:19:37,197 INFO L226 Difference]: Without dead ends: 360 [2024-10-12 16:19:37,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:19:37,209 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:37,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:19:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-12 16:19:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-12 16:19:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-12 16:19:37,278 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 60 [2024-10-12 16:19:37,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:37,279 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-12 16:19:37,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-12 16:19:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 16:19:37,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:37,282 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, 1, 1] [2024-10-12 16:19:37,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:19:37,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:37,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash 514980099, now seen corresponding path program 1 times [2024-10-12 16:19:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:37,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208867264] [2024-10-12 16:19:37,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:37,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:37,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208867264] [2024-10-12 16:19:37,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208867264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:37,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:37,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:37,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615028303] [2024-10-12 16:19:37,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:37,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:37,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:37,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:37,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:37,550 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:39,274 INFO L93 Difference]: Finished difference Result 1025 states and 1788 transitions. [2024-10-12 16:19:39,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:39,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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 60 [2024-10-12 16:19:39,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:39,279 INFO L225 Difference]: With dead ends: 1025 [2024-10-12 16:19:39,279 INFO L226 Difference]: Without dead ends: 666 [2024-10-12 16:19:39,280 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-10-12 16:19:39,281 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 267 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:39,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:19:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-12 16:19:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2024-10-12 16:19:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4796380090497738) internal successors, (981), 663 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 981 transitions. [2024-10-12 16:19:39,331 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 981 transitions. Word has length 60 [2024-10-12 16:19:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:39,334 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 981 transitions. [2024-10-12 16:19:39,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 981 transitions. [2024-10-12 16:19:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 16:19:39,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:39,341 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:19:39,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:19:39,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:39,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1372562485, now seen corresponding path program 1 times [2024-10-12 16:19:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:39,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116234490] [2024-10-12 16:19:39,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:39,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:39,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116234490] [2024-10-12 16:19:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116234490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:39,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:39,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402705221] [2024-10-12 16:19:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:39,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:39,568 INFO L87 Difference]: Start difference. First operand 664 states and 981 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:41,087 INFO L93 Difference]: Finished difference Result 1954 states and 2893 transitions. [2024-10-12 16:19:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:41,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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 135 [2024-10-12 16:19:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:41,092 INFO L225 Difference]: With dead ends: 1954 [2024-10-12 16:19:41,093 INFO L226 Difference]: Without dead ends: 1291 [2024-10-12 16:19:41,094 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-10-12 16:19:41,095 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:41,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 325 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:19:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-10-12 16:19:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1281. [2024-10-12 16:19:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39921875) internal successors, (1791), 1280 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1791 transitions. [2024-10-12 16:19:41,123 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1791 transitions. Word has length 135 [2024-10-12 16:19:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:41,125 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1791 transitions. [2024-10-12 16:19:41,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1791 transitions. [2024-10-12 16:19:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-12 16:19:41,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:41,129 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, 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-10-12 16:19:41,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:19:41,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:41,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash 274354623, now seen corresponding path program 1 times [2024-10-12 16:19:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:41,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940019910] [2024-10-12 16:19:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:41,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:41,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940019910] [2024-10-12 16:19:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940019910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:41,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:41,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:41,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526422762] [2024-10-12 16:19:41,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:41,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:41,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:41,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:41,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:41,382 INFO L87 Difference]: Start difference. First operand 1281 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:43,124 INFO L93 Difference]: Finished difference Result 3763 states and 5262 transitions. [2024-10-12 16:19:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 139 [2024-10-12 16:19:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:43,133 INFO L225 Difference]: With dead ends: 3763 [2024-10-12 16:19:43,133 INFO L226 Difference]: Without dead ends: 2483 [2024-10-12 16:19:43,135 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-10-12 16:19:43,136 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:43,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 364 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:19:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-10-12 16:19:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2181. [2024-10-12 16:19:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.281651376146789) internal successors, (2794), 2180 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2794 transitions. [2024-10-12 16:19:43,175 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2794 transitions. Word has length 139 [2024-10-12 16:19:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:43,175 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 2794 transitions. [2024-10-12 16:19:43,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2794 transitions. [2024-10-12 16:19:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-12 16:19:43,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:43,183 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, 3, 3, 3, 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] [2024-10-12 16:19:43,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:19:43,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:43,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash 531438622, now seen corresponding path program 1 times [2024-10-12 16:19:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:43,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78238951] [2024-10-12 16:19:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 16:19:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78238951] [2024-10-12 16:19:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78238951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:43,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:43,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:43,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192252933] [2024-10-12 16:19:43,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:43,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:43,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:43,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:43,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:43,398 INFO L87 Difference]: Start difference. First operand 2181 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:44,828 INFO L93 Difference]: Finished difference Result 6165 states and 7960 transitions. [2024-10-12 16:19:44,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:44,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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 230 [2024-10-12 16:19:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:44,841 INFO L225 Difference]: With dead ends: 6165 [2024-10-12 16:19:44,841 INFO L226 Difference]: Without dead ends: 3985 [2024-10-12 16:19:44,844 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-10-12 16:19:44,846 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:44,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:19:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2024-10-12 16:19:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3681. [2024-10-12 16:19:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3680 states have (on average 1.2201086956521738) internal successors, (4490), 3680 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4490 transitions. [2024-10-12 16:19:44,909 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4490 transitions. Word has length 230 [2024-10-12 16:19:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:44,911 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4490 transitions. [2024-10-12 16:19:44,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4490 transitions. [2024-10-12 16:19:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-12 16:19:44,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:44,916 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, 3, 3, 3, 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, 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, 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-10-12 16:19:44,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:19:44,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:44,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2138969610, now seen corresponding path program 1 times [2024-10-12 16:19:44,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:44,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748733120] [2024-10-12 16:19:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 16:19:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748733120] [2024-10-12 16:19:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748733120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:45,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:45,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532277676] [2024-10-12 16:19:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:45,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:45,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:45,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:45,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:45,727 INFO L87 Difference]: Start difference. First operand 3681 states and 4490 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:47,031 INFO L93 Difference]: Finished difference Result 7660 states and 9290 transitions. [2024-10-12 16:19:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:47,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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 332 [2024-10-12 16:19:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:47,046 INFO L225 Difference]: With dead ends: 7660 [2024-10-12 16:19:47,046 INFO L226 Difference]: Without dead ends: 3980 [2024-10-12 16:19:47,051 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-10-12 16:19:47,052 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:47,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:19:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2024-10-12 16:19:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3980. [2024-10-12 16:19:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3979 states have (on average 1.2050766524252325) internal successors, (4795), 3979 states have internal predecessors, (4795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 4795 transitions. [2024-10-12 16:19:47,149 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 4795 transitions. Word has length 332 [2024-10-12 16:19:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:47,150 INFO L471 AbstractCegarLoop]: Abstraction has 3980 states and 4795 transitions. [2024-10-12 16:19:47,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 4795 transitions. [2024-10-12 16:19:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-12 16:19:47,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:47,155 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, 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, 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, 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-10-12 16:19:47,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:19:47,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:47,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash 187973811, now seen corresponding path program 1 times [2024-10-12 16:19:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957609668] [2024-10-12 16:19:47,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:47,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 16:19:47,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:47,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957609668] [2024-10-12 16:19:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957609668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:47,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:47,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261685726] [2024-10-12 16:19:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:47,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:47,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:47,509 INFO L87 Difference]: Start difference. First operand 3980 states and 4795 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:49,303 INFO L93 Difference]: Finished difference Result 9464 states and 11673 transitions. [2024-10-12 16:19:49,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:49,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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 347 [2024-10-12 16:19:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:49,316 INFO L225 Difference]: With dead ends: 9464 [2024-10-12 16:19:49,316 INFO L226 Difference]: Without dead ends: 5784 [2024-10-12 16:19:49,321 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-10-12 16:19:49,322 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 255 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:49,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 668 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:19:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2024-10-12 16:19:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5782. [2024-10-12 16:19:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 5781 states have (on average 1.167618059159315) internal successors, (6750), 5781 states have internal predecessors, (6750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 6750 transitions. [2024-10-12 16:19:49,407 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 6750 transitions. Word has length 347 [2024-10-12 16:19:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:49,408 INFO L471 AbstractCegarLoop]: Abstraction has 5782 states and 6750 transitions. [2024-10-12 16:19:49,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 6750 transitions. [2024-10-12 16:19:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-10-12 16:19:49,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:49,416 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, 3, 3, 3, 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, 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, 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, 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-10-12 16:19:49,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:19:49,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:49,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash -964217180, now seen corresponding path program 1 times [2024-10-12 16:19:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:49,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808945790] [2024-10-12 16:19:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:49,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 16:19:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:49,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808945790] [2024-10-12 16:19:49,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808945790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894824377] [2024-10-12 16:19:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:49,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:49,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:49,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:49,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:49,737 INFO L87 Difference]: Start difference. First operand 5782 states and 6750 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:51,215 INFO L93 Difference]: Finished difference Result 13363 states and 15909 transitions. [2024-10-12 16:19:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:51,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 406 [2024-10-12 16:19:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:51,240 INFO L225 Difference]: With dead ends: 13363 [2024-10-12 16:19:51,240 INFO L226 Difference]: Without dead ends: 7881 [2024-10-12 16:19:51,247 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-10-12 16:19:51,248 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 266 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:51,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 632 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:19:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2024-10-12 16:19:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7283. [2024-10-12 16:19:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7283 states, 7282 states have (on average 1.148722878330129) internal successors, (8365), 7282 states have internal predecessors, (8365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 8365 transitions. [2024-10-12 16:19:51,349 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 8365 transitions. Word has length 406 [2024-10-12 16:19:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:51,350 INFO L471 AbstractCegarLoop]: Abstraction has 7283 states and 8365 transitions. [2024-10-12 16:19:51,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 8365 transitions. [2024-10-12 16:19:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2024-10-12 16:19:51,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:51,354 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, 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, 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, 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, 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, 1, 1, 1, 1] [2024-10-12 16:19:51,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:19:51,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:51,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:51,355 INFO L85 PathProgramCache]: Analyzing trace with hash 335904033, now seen corresponding path program 1 times [2024-10-12 16:19:51,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:51,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366948679] [2024-10-12 16:19:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:51,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 16:19:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:51,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366948679] [2024-10-12 16:19:51,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366948679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:51,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:51,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547497446] [2024-10-12 16:19:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:51,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:51,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:51,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:51,785 INFO L87 Difference]: Start difference. First operand 7283 states and 8365 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:53,209 INFO L93 Difference]: Finished difference Result 16068 states and 18813 transitions. [2024-10-12 16:19:53,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:53,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 421 [2024-10-12 16:19:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:53,231 INFO L225 Difference]: With dead ends: 16068 [2024-10-12 16:19:53,231 INFO L226 Difference]: Without dead ends: 9085 [2024-10-12 16:19:53,239 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-10-12 16:19:53,240 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 268 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:53,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 620 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:19:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9085 states. [2024-10-12 16:19:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9085 to 8480. [2024-10-12 16:19:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8480 states, 8479 states have (on average 1.1379879702795141) internal successors, (9649), 8479 states have internal predecessors, (9649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 9649 transitions. [2024-10-12 16:19:53,371 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 9649 transitions. Word has length 421 [2024-10-12 16:19:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:53,372 INFO L471 AbstractCegarLoop]: Abstraction has 8480 states and 9649 transitions. [2024-10-12 16:19:53,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:53,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 9649 transitions. [2024-10-12 16:19:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2024-10-12 16:19:53,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:53,379 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:19:53,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:19:53,379 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:53,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1399604565, now seen corresponding path program 1 times [2024-10-12 16:19:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056663804] [2024-10-12 16:19:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-12 16:19:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056663804] [2024-10-12 16:19:53,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056663804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:53,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:53,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:53,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670042760] [2024-10-12 16:19:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:53,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:53,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:53,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:53,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:53,804 INFO L87 Difference]: Start difference. First operand 8480 states and 9649 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:55,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:55,056 INFO L93 Difference]: Finished difference Result 19650 states and 22542 transitions. [2024-10-12 16:19:55,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:55,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 511 [2024-10-12 16:19:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:55,076 INFO L225 Difference]: With dead ends: 19650 [2024-10-12 16:19:55,076 INFO L226 Difference]: Without dead ends: 11470 [2024-10-12 16:19:55,084 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-10-12 16:19:55,085 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 147 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:55,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 313 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:19:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2024-10-12 16:19:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 7577. [2024-10-12 16:19:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7577 states, 7576 states have (on average 1.1486272439281944) internal successors, (8702), 7576 states have internal predecessors, (8702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 8702 transitions. [2024-10-12 16:19:55,261 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 8702 transitions. Word has length 511 [2024-10-12 16:19:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:55,262 INFO L471 AbstractCegarLoop]: Abstraction has 7577 states and 8702 transitions. [2024-10-12 16:19:55,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 8702 transitions. [2024-10-12 16:19:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2024-10-12 16:19:55,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:55,269 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, 5, 5, 5, 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, 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, 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-10-12 16:19:55,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:19:55,269 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:55,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash -172023300, now seen corresponding path program 1 times [2024-10-12 16:19:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:55,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483593042] [2024-10-12 16:19:55,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:55,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 527 proven. 39 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-10-12 16:19:55,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:55,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483593042] [2024-10-12 16:19:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483593042] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:19:55,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313175017] [2024-10-12 16:19:55,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:55,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:19:55,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:19:55,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:19:55,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:19:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:56,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:19:56,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:19:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-12 16:19:56,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:19:56,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313175017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:56,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:19:56,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:19:56,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752899490] [2024-10-12 16:19:56,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:56,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:56,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:56,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:56,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:56,298 INFO L87 Difference]: Start difference. First operand 7577 states and 8702 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:57,478 INFO L93 Difference]: Finished difference Result 17245 states and 20054 transitions. [2024-10-12 16:19:57,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:57,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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 544 [2024-10-12 16:19:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:57,495 INFO L225 Difference]: With dead ends: 17245 [2024-10-12 16:19:57,495 INFO L226 Difference]: Without dead ends: 9968 [2024-10-12 16:19:57,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:57,503 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 356 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:57,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 444 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:19:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2024-10-12 16:19:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 9968. [2024-10-12 16:19:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 1.1499949834453698) internal successors, (11462), 9967 states have internal predecessors, (11462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 11462 transitions. [2024-10-12 16:19:57,676 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 11462 transitions. Word has length 544 [2024-10-12 16:19:57,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:57,677 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 11462 transitions. [2024-10-12 16:19:57,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 11462 transitions. [2024-10-12 16:19:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2024-10-12 16:19:57,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:57,686 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, 5, 5, 5, 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, 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, 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-10-12 16:19:57,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:19:57,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 16:19:57,888 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:57,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:57,889 INFO L85 PathProgramCache]: Analyzing trace with hash 288855046, now seen corresponding path program 1 times [2024-10-12 16:19:57,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:57,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841735195] [2024-10-12 16:19:57,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-12 16:19:58,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:58,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841735195] [2024-10-12 16:19:58,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841735195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:58,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:58,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952496140] [2024-10-12 16:19:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:58,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:58,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:58,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:58,461 INFO L87 Difference]: Start difference. First operand 9968 states and 11462 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:59,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:59,937 INFO L93 Difference]: Finished difference Result 24135 states and 28001 transitions. [2024-10-12 16:19:59,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:59,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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 548 [2024-10-12 16:19:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:59,963 INFO L225 Difference]: With dead ends: 24135 [2024-10-12 16:19:59,963 INFO L226 Difference]: Without dead ends: 14467 [2024-10-12 16:19:59,973 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-10-12 16:19:59,974 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:59,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 618 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:19:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14467 states. [2024-10-12 16:20:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14467 to 14157. [2024-10-12 16:20:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14157 states, 14156 states have (on average 1.13485447866629) internal successors, (16065), 14156 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14157 states to 14157 states and 16065 transitions. [2024-10-12 16:20:00,163 INFO L78 Accepts]: Start accepts. Automaton has 14157 states and 16065 transitions. Word has length 548 [2024-10-12 16:20:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:00,163 INFO L471 AbstractCegarLoop]: Abstraction has 14157 states and 16065 transitions. [2024-10-12 16:20:00,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 14157 states and 16065 transitions. [2024-10-12 16:20:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2024-10-12 16:20:00,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:00,174 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, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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, 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-10-12 16:20:00,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:20:00,175 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:00,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1867923366, now seen corresponding path program 1 times [2024-10-12 16:20:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:00,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484256033] [2024-10-12 16:20:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:00,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 684 proven. 39 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2024-10-12 16:20:00,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484256033] [2024-10-12 16:20:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484256033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380010663] [2024-10-12 16:20:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:00,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:00,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:20:00,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:20:00,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:20:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:01,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:20:01,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:20:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-12 16:20:01,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:20:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380010663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:20:01,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:20:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136584684] [2024-10-12 16:20:01,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:01,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:01,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:20:01,228 INFO L87 Difference]: Start difference. First operand 14157 states and 16065 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:02,557 INFO L93 Difference]: Finished difference Result 27711 states and 31489 transitions. [2024-10-12 16:20:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 623 [2024-10-12 16:20:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:02,581 INFO L225 Difference]: With dead ends: 27711 [2024-10-12 16:20:02,581 INFO L226 Difference]: Without dead ends: 13854 [2024-10-12 16:20:02,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:20:02,593 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 252 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:02,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 601 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:20:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13854 states. [2024-10-12 16:20:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13854 to 13853. [2024-10-12 16:20:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13853 states, 13852 states have (on average 1.081648859370488) internal successors, (14983), 13852 states have internal predecessors, (14983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 14983 transitions. [2024-10-12 16:20:02,741 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 14983 transitions. Word has length 623 [2024-10-12 16:20:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:02,742 INFO L471 AbstractCegarLoop]: Abstraction has 13853 states and 14983 transitions. [2024-10-12 16:20:02,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 14983 transitions. [2024-10-12 16:20:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2024-10-12 16:20:02,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:02,752 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, 5, 5, 5, 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, 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, 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] [2024-10-12 16:20:02,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:20:02,956 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,SelfDestructingSolverStorable12 [2024-10-12 16:20:02,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:02,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1573979579, now seen corresponding path program 1 times [2024-10-12 16:20:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:02,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694812505] [2024-10-12 16:20:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 611 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-10-12 16:20:03,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:03,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694812505] [2024-10-12 16:20:03,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694812505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:03,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95557916] [2024-10-12 16:20:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:03,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:03,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:20:03,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:20:03,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 16:20:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:03,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:20:03,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:20:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-10-12 16:20:04,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:20:04,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95557916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:04,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:20:04,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:20:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275553942] [2024-10-12 16:20:04,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:04,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:20:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:04,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:20:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:20:04,864 INFO L87 Difference]: Start difference. First operand 13853 states and 14983 transitions. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:06,483 INFO L93 Difference]: Finished difference Result 28903 states and 31297 transitions. [2024-10-12 16:20:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:20:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 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 624 [2024-10-12 16:20:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:06,507 INFO L225 Difference]: With dead ends: 28903 [2024-10-12 16:20:06,507 INFO L226 Difference]: Without dead ends: 15051 [2024-10-12 16:20:06,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:20:06,518 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 317 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:06,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 355 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:20:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15051 states. [2024-10-12 16:20:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15051 to 14751. [2024-10-12 16:20:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14751 states, 14750 states have (on average 1.079728813559322) internal successors, (15926), 14750 states have internal predecessors, (15926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14751 states to 14751 states and 15926 transitions. [2024-10-12 16:20:06,669 INFO L78 Accepts]: Start accepts. Automaton has 14751 states and 15926 transitions. Word has length 624 [2024-10-12 16:20:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:06,669 INFO L471 AbstractCegarLoop]: Abstraction has 14751 states and 15926 transitions. [2024-10-12 16:20:06,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 14751 states and 15926 transitions. [2024-10-12 16:20:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2024-10-12 16:20:06,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:06,681 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:20:06,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 16:20:06,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:06,881 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:06,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:06,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1905666958, now seen corresponding path program 1 times [2024-10-12 16:20:06,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:06,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432210725] [2024-10-12 16:20:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-10-12 16:20:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:07,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432210725] [2024-10-12 16:20:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432210725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:07,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:07,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70140951] [2024-10-12 16:20:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:07,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:07,242 INFO L87 Difference]: Start difference. First operand 14751 states and 15926 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:08,458 INFO L93 Difference]: Finished difference Result 37569 states and 40550 transitions. [2024-10-12 16:20:08,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:08,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 661 [2024-10-12 16:20:08,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:08,485 INFO L225 Difference]: With dead ends: 37569 [2024-10-12 16:20:08,485 INFO L226 Difference]: Without dead ends: 18932 [2024-10-12 16:20:08,500 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-10-12 16:20:08,501 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 255 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:08,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 643 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:20:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2024-10-12 16:20:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 17138. [2024-10-12 16:20:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17138 states, 17137 states have (on average 1.0516426445702283) internal successors, (18022), 17137 states have internal predecessors, (18022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17138 states to 17138 states and 18022 transitions. [2024-10-12 16:20:08,698 INFO L78 Accepts]: Start accepts. Automaton has 17138 states and 18022 transitions. Word has length 661 [2024-10-12 16:20:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:08,699 INFO L471 AbstractCegarLoop]: Abstraction has 17138 states and 18022 transitions. [2024-10-12 16:20:08,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 17138 states and 18022 transitions. [2024-10-12 16:20:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2024-10-12 16:20:08,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:08,712 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, 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, 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, 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, 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, 1, 1] [2024-10-12 16:20:08,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:20:08,712 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:08,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:08,713 INFO L85 PathProgramCache]: Analyzing trace with hash 911776274, now seen corresponding path program 1 times [2024-10-12 16:20:08,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:08,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753788761] [2024-10-12 16:20:08,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:08,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 16:20:09,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753788761] [2024-10-12 16:20:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753788761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:09,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:09,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:09,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927705316] [2024-10-12 16:20:09,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:09,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:09,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:09,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:09,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:09,336 INFO L87 Difference]: Start difference. First operand 17138 states and 18022 transitions. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:10,722 INFO L93 Difference]: Finished difference Result 39664 states and 41722 transitions. [2024-10-12 16:20:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:10,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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 685 [2024-10-12 16:20:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:10,745 INFO L225 Difference]: With dead ends: 39664 [2024-10-12 16:20:10,746 INFO L226 Difference]: Without dead ends: 20135 [2024-10-12 16:20:10,761 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-10-12 16:20:10,762 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 90 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:10,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 564 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:20:10,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20135 states. [2024-10-12 16:20:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20135 to 20133. [2024-10-12 16:20:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20133 states, 20132 states have (on average 1.0469898668786013) internal successors, (21078), 20132 states have internal predecessors, (21078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20133 states to 20133 states and 21078 transitions. [2024-10-12 16:20:10,969 INFO L78 Accepts]: Start accepts. Automaton has 20133 states and 21078 transitions. Word has length 685 [2024-10-12 16:20:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:10,969 INFO L471 AbstractCegarLoop]: Abstraction has 20133 states and 21078 transitions. [2024-10-12 16:20:10,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 20133 states and 21078 transitions. [2024-10-12 16:20:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2024-10-12 16:20:10,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:10,987 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, 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, 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, 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, 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, 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, 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-10-12 16:20:10,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:20:10,987 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:10,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1068147657, now seen corresponding path program 1 times [2024-10-12 16:20:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587667397] [2024-10-12 16:20:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-10-12 16:20:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587667397] [2024-10-12 16:20:11,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587667397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:11,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:11,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:11,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400644498] [2024-10-12 16:20:11,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:11,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:11,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:11,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:11,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:11,618 INFO L87 Difference]: Start difference. First operand 20133 states and 21078 transitions. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:12,605 INFO L93 Difference]: Finished difference Result 44448 states and 46623 transitions. [2024-10-12 16:20:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:12,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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 787 [2024-10-12 16:20:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:12,628 INFO L225 Difference]: With dead ends: 44448 [2024-10-12 16:20:12,628 INFO L226 Difference]: Without dead ends: 24316 [2024-10-12 16:20:12,645 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-10-12 16:20:12,645 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 184 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:12,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 215 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:20:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24316 states. [2024-10-12 16:20:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24316 to 22223. [2024-10-12 16:20:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22223 states, 22222 states have (on average 1.046350463504635) internal successors, (23252), 22222 states have internal predecessors, (23252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22223 states to 22223 states and 23252 transitions. [2024-10-12 16:20:12,881 INFO L78 Accepts]: Start accepts. Automaton has 22223 states and 23252 transitions. Word has length 787 [2024-10-12 16:20:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:12,882 INFO L471 AbstractCegarLoop]: Abstraction has 22223 states and 23252 transitions. [2024-10-12 16:20:12,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 22223 states and 23252 transitions. [2024-10-12 16:20:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2024-10-12 16:20:12,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:12,901 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, 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, 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, 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, 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] [2024-10-12 16:20:12,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:20:12,902 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:12,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1801830586, now seen corresponding path program 1 times [2024-10-12 16:20:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103500627] [2024-10-12 16:20:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-10-12 16:20:13,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:13,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103500627] [2024-10-12 16:20:13,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103500627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:13,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:13,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646518968] [2024-10-12 16:20:13,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:13,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:13,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:13,388 INFO L87 Difference]: Start difference. First operand 22223 states and 23252 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:14,533 INFO L93 Difference]: Finished difference Result 48327 states and 50592 transitions. [2024-10-12 16:20:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:14,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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 845 [2024-10-12 16:20:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:14,560 INFO L225 Difference]: With dead ends: 48327 [2024-10-12 16:20:14,560 INFO L226 Difference]: Without dead ends: 24909 [2024-10-12 16:20:14,576 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-10-12 16:20:14,577 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 317 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:14,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 551 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:20:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24909 states. [2024-10-12 16:20:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24909 to 21915. [2024-10-12 16:20:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21915 states, 21914 states have (on average 1.0428949529980833) internal successors, (22854), 21914 states have internal predecessors, (22854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21915 states to 21915 states and 22854 transitions. [2024-10-12 16:20:14,750 INFO L78 Accepts]: Start accepts. Automaton has 21915 states and 22854 transitions. Word has length 845 [2024-10-12 16:20:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:14,750 INFO L471 AbstractCegarLoop]: Abstraction has 21915 states and 22854 transitions. [2024-10-12 16:20:14,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 21915 states and 22854 transitions. [2024-10-12 16:20:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 867 [2024-10-12 16:20:14,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:14,809 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:20:14,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:20:14,809 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:14,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:14,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1341291920, now seen corresponding path program 1 times [2024-10-12 16:20:14,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:14,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239973036] [2024-10-12 16:20:14,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:14,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 637 proven. 269 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-12 16:20:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239973036] [2024-10-12 16:20:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239973036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:16,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542504235] [2024-10-12 16:20:16,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:16,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:16,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:20:16,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:20:16,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 16:20:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:16,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 16:20:16,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:20:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2024-10-12 16:20:16,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:20:16,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542504235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:16,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:20:16,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:20:16,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926922847] [2024-10-12 16:20:16,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:16,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:16,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:16,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:16,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:20:16,615 INFO L87 Difference]: Start difference. First operand 21915 states and 22854 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:17,817 INFO L93 Difference]: Finished difference Result 49530 states and 51608 transitions. [2024-10-12 16:20:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:17,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 866 [2024-10-12 16:20:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:17,848 INFO L225 Difference]: With dead ends: 49530 [2024-10-12 16:20:17,849 INFO L226 Difference]: Without dead ends: 27616 [2024-10-12 16:20:17,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 865 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:20:17,866 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 274 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:17,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 536 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:20:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27616 states. [2024-10-12 16:20:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27616 to 24912. [2024-10-12 16:20:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24912 states, 24911 states have (on average 1.0418690538316406) internal successors, (25954), 24911 states have internal predecessors, (25954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24912 states to 24912 states and 25954 transitions. [2024-10-12 16:20:18,119 INFO L78 Accepts]: Start accepts. Automaton has 24912 states and 25954 transitions. Word has length 866 [2024-10-12 16:20:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:18,119 INFO L471 AbstractCegarLoop]: Abstraction has 24912 states and 25954 transitions. [2024-10-12 16:20:18,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 24912 states and 25954 transitions. [2024-10-12 16:20:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2024-10-12 16:20:18,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:18,131 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, 6, 6, 6, 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, 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, 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, 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-10-12 16:20:18,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 16:20:18,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:18,332 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:18,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1866566725, now seen corresponding path program 1 times [2024-10-12 16:20:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:18,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255902512] [2024-10-12 16:20:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:18,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 859 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-10-12 16:20:19,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255902512] [2024-10-12 16:20:19,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255902512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:19,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:19,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:19,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487749319] [2024-10-12 16:20:19,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:19,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:19,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:19,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:19,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:19,330 INFO L87 Difference]: Start difference. First operand 24912 states and 25954 transitions. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:20,521 INFO L93 Difference]: Finished difference Result 54626 states and 56858 transitions. [2024-10-12 16:20:20,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:20,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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 899 [2024-10-12 16:20:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:20,550 INFO L225 Difference]: With dead ends: 54626 [2024-10-12 16:20:20,550 INFO L226 Difference]: Without dead ends: 29416 [2024-10-12 16:20:20,567 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-10-12 16:20:20,568 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 147 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:20,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 531 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:20:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29416 states. [2024-10-12 16:20:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29416 to 24609. [2024-10-12 16:20:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24609 states, 24608 states have (on average 1.0419375812743823) internal successors, (25640), 24608 states have internal predecessors, (25640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24609 states to 24609 states and 25640 transitions. [2024-10-12 16:20:20,802 INFO L78 Accepts]: Start accepts. Automaton has 24609 states and 25640 transitions. Word has length 899 [2024-10-12 16:20:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:20,803 INFO L471 AbstractCegarLoop]: Abstraction has 24609 states and 25640 transitions. [2024-10-12 16:20:20,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 24609 states and 25640 transitions. [2024-10-12 16:20:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2024-10-12 16:20:20,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:20,813 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, 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, 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, 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, 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] [2024-10-12 16:20:20,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 16:20:20,814 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:20,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash 950820433, now seen corresponding path program 1 times [2024-10-12 16:20:20,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:20,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951095050] [2024-10-12 16:20:20,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:20,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 711 proven. 269 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-12 16:20:22,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:22,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951095050] [2024-10-12 16:20:22,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951095050] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:22,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040840037] [2024-10-12 16:20:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:22,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:22,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:20:22,185 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:20:22,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 16:20:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:22,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 16:20:22,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:20:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-12 16:20:24,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:20:24,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040840037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:24,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:20:24,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:20:24,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070081057] [2024-10-12 16:20:24,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:24,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:24,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:24,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:24,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:20:24,644 INFO L87 Difference]: Start difference. First operand 24609 states and 25640 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:25,940 INFO L93 Difference]: Finished difference Result 53423 states and 55628 transitions. [2024-10-12 16:20:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:25,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 903 [2024-10-12 16:20:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:25,965 INFO L225 Difference]: With dead ends: 53423 [2024-10-12 16:20:25,965 INFO L226 Difference]: Without dead ends: 28815 [2024-10-12 16:20:25,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:20:25,980 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 279 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:25,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 523 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:20:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28815 states. [2024-10-12 16:20:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28815 to 25506. [2024-10-12 16:20:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25506 states, 25505 states have (on average 1.040541070378357) internal successors, (26539), 25505 states have internal predecessors, (26539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25506 states to 25506 states and 26539 transitions. [2024-10-12 16:20:26,195 INFO L78 Accepts]: Start accepts. Automaton has 25506 states and 26539 transitions. Word has length 903 [2024-10-12 16:20:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:26,195 INFO L471 AbstractCegarLoop]: Abstraction has 25506 states and 26539 transitions. [2024-10-12 16:20:26,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 25506 states and 26539 transitions. [2024-10-12 16:20:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1025 [2024-10-12 16:20:26,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:26,206 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, 6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:20:26,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 16:20:26,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:26,407 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:26,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:26,407 INFO L85 PathProgramCache]: Analyzing trace with hash 361076006, now seen corresponding path program 1 times [2024-10-12 16:20:26,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:26,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304648214] [2024-10-12 16:20:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 1281 proven. 90 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-10-12 16:20:27,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:27,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304648214] [2024-10-12 16:20:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304648214] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:27,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256782866] [2024-10-12 16:20:27,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:27,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:27,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:20:27,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:20:27,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 16:20:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:28,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 16:20:28,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:20:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 1188 proven. 399 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-12 16:20:28,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:20:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 933 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2024-10-12 16:20:29,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256782866] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:29,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:20:29,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 6] total 10 [2024-10-12 16:20:29,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848061188] [2024-10-12 16:20:29,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:29,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:20:29,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:29,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:20:29,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-12 16:20:29,077 INFO L87 Difference]: Start difference. First operand 25506 states and 26539 transitions. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:30,595 INFO L93 Difference]: Finished difference Result 53412 states and 55528 transitions. [2024-10-12 16:20:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:20:30,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 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 1024 [2024-10-12 16:20:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:30,627 INFO L225 Difference]: With dead ends: 53412 [2024-10-12 16:20:30,628 INFO L226 Difference]: Without dead ends: 27608 [2024-10-12 16:20:30,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2053 GetRequests, 2045 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-12 16:20:30,644 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 482 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:30,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 65 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:20:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27608 states. [2024-10-12 16:20:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27608 to 22209. [2024-10-12 16:20:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22209 states, 22208 states have (on average 1.0400756484149856) internal successors, (23098), 22208 states have internal predecessors, (23098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22209 states to 22209 states and 23098 transitions. [2024-10-12 16:20:30,820 INFO L78 Accepts]: Start accepts. Automaton has 22209 states and 23098 transitions. Word has length 1024 [2024-10-12 16:20:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:30,821 INFO L471 AbstractCegarLoop]: Abstraction has 22209 states and 23098 transitions. [2024-10-12 16:20:30,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 22209 states and 23098 transitions. [2024-10-12 16:20:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1725 [2024-10-12 16:20:30,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:30,847 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:20:30,860 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-10-12 16:20:31,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:31,048 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:31,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash -286849876, now seen corresponding path program 1 times [2024-10-12 16:20:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:31,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737395611] [2024-10-12 16:20:31,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6238 backedges. 2890 proven. 0 refuted. 0 times theorem prover too weak. 3348 trivial. 0 not checked. [2024-10-12 16:20:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:32,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737395611] [2024-10-12 16:20:32,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737395611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:32,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:32,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:32,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213696519] [2024-10-12 16:20:32,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:32,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:32,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:32,756 INFO L87 Difference]: Start difference. First operand 22209 states and 23098 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:33,606 INFO L93 Difference]: Finished difference Result 33907 states and 35071 transitions. [2024-10-12 16:20:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:33,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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 1724 [2024-10-12 16:20:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:33,608 INFO L225 Difference]: With dead ends: 33907 [2024-10-12 16:20:33,608 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:20:33,619 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-10-12 16:20:33,619 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 316 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:33,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 76 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:20:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:20:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:20:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:20:33,621 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1724 [2024-10-12 16:20:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:33,621 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:20:33,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:20:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:20:33,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:20:33,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:20:33,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 16:20:33,627 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:20:33,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 16:20:36,289 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:20:36,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:20:36 BoogieIcfgContainer [2024-10-12 16:20:36,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:20:36,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:20:36,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:20:36,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:20:36,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:19:36" (3/4) ... [2024-10-12 16:20:36,326 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 16:20:36,358 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-12 16:20:36,360 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 16:20:36,362 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 16:20:36,364 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 16:20:36,589 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:20:36,589 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 16:20:36,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:20:36,590 INFO L158 Benchmark]: Toolchain (without parser) took 63826.00ms. Allocated memory was 184.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 120.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2024-10-12 16:20:36,590 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:20:36,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 912.91ms. Allocated memory is still 184.5MB. Free memory was 120.4MB in the beginning and 90.6MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-12 16:20:36,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 251.18ms. Allocated memory is still 184.5MB. Free memory was 90.6MB in the beginning and 126.9MB in the end (delta: -36.3MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2024-10-12 16:20:36,591 INFO L158 Benchmark]: Boogie Preprocessor took 326.11ms. Allocated memory is still 184.5MB. Free memory was 126.9MB in the beginning and 85.3MB in the end (delta: 41.5MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-10-12 16:20:36,592 INFO L158 Benchmark]: RCFGBuilder took 2421.31ms. Allocated memory was 184.5MB in the beginning and 308.3MB in the end (delta: 123.7MB). Free memory was 85.3MB in the beginning and 125.4MB in the end (delta: -40.1MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2024-10-12 16:20:36,592 INFO L158 Benchmark]: TraceAbstraction took 59639.82ms. Allocated memory was 308.3MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 124.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-12 16:20:36,592 INFO L158 Benchmark]: Witness Printer took 266.41ms. Allocated memory is still 1.9GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 16:20:36,595 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 912.91ms. Allocated memory is still 184.5MB. Free memory was 120.4MB in the beginning and 90.6MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 251.18ms. Allocated memory is still 184.5MB. Free memory was 90.6MB in the beginning and 126.9MB in the end (delta: -36.3MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 326.11ms. Allocated memory is still 184.5MB. Free memory was 126.9MB in the beginning and 85.3MB in the end (delta: 41.5MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2421.31ms. Allocated memory was 184.5MB in the beginning and 308.3MB in the end (delta: 123.7MB). Free memory was 85.3MB in the beginning and 125.4MB in the end (delta: -40.1MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. * TraceAbstraction took 59639.82ms. Allocated memory was 308.3MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 124.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 266.41ms. Allocated memory is still 1.9GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 200]: 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, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.8s, OverallIterations: 23, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5574 SdHoareTripleChecker+Valid, 28.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5574 mSDsluCounter, 10277 SdHoareTripleChecker+Invalid, 23.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 761 mSDsCounter, 3997 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21006 IncrementalHoareTripleChecker+Invalid, 25003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3997 mSolverCounterUnsat, 9516 mSDtfsCounter, 21006 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5673 GetRequests, 5628 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25506occurred in iteration=21, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 29429 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 17958 NumberOfCodeBlocks, 17958 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 18952 ConstructedInterpolants, 0 QuantifiedInterpolants, 58012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5436 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 30 InterpolantComputations, 23 PerfectInterpolantSequences, 28140/29284 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: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((long long) 89 + a4) <= 0) && (0 <= ((long long) 600143 + a29))) && (3 == a2)) && (((long long) a29 + 127) <= 0)) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) 600143 + a29)))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) 98 + a0) <= 0))) || (((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) a29 + 13)))) || ((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (a2 == 1)) && (0 <= ((long long) 600143 + a29)))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (0 <= ((long long) 600143 + a29)))) || (((((long long) a0 + 147) <= 0) && (a2 == 1)) && (0 <= ((long long) 600143 + a29)))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0))) || ((((0 <= ((long long) a4 + 85)) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 99) <= 0)) && (3 == a2))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) 600143 + a29))) && (a2 == 4)) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) <= 0))) || ((((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) 600143 + a29))) && (3 == a2))) || (((44 <= a29) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((((long long) a0 + 147) <= 0) && (0 <= ((long long) 600143 + a29))) && (3 == a2)) && (a29 <= 43))) || ((((0 <= ((long long) a4 + 85)) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (a2 == 1)) && (a29 <= 43))) || (((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || ((((0 <= ((long long) a4 + 85)) && (a2 == 1)) && (0 <= ((long long) 600143 + a29))) && (a29 <= 43))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 3))) && (((long long) 98 + a0) <= 0))) || ((((0 <= ((long long) a4 + 85)) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 600143 + a29))) && (a2 == 4))) || ((((44 <= a29) && (((long long) a0 + 99) <= 0)) && (((long long) 89 + a4) <= 0)) && (a2 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-12 16:20:36,630 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