./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label02.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 30f62f9fddfecd916215dd8f1b75b140359bb989ba38a829add2eea4e4b271dc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:48:09,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:48:09,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:48:09,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:48:09,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:48:09,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:48:09,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:48:09,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:48:09,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:48:09,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:48:09,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:48:09,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:48:09,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:48:09,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:48:09,892 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:48:09,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:48:09,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:48:09,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:48:09,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:48:09,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:48:09,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:48:09,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:48:09,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:48:09,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:48:09,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:48:09,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:48:09,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:48:09,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:48:09,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:48:09,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:48:09,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:48:09,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:48:09,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:48:09,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:48:09,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:48:09,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:48:09,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:48:09,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:48:09,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:48:09,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:48:09,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:48:09,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:48:09,898 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 -> 30f62f9fddfecd916215dd8f1b75b140359bb989ba38a829add2eea4e4b271dc [2024-11-11 16:48:10,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:48:10,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:48:10,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:48:10,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:48:10,170 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:48:10,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2024-11-11 16:48:11,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:48:11,932 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:48:11,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2024-11-11 16:48:11,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc17cba0a/c2e1e979925b4d219ae1db533d45cf2c/FLAG3ccce27bf [2024-11-11 16:48:11,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc17cba0a/c2e1e979925b4d219ae1db533d45cf2c [2024-11-11 16:48:11,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:48:11,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:48:11,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:48:11,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:48:11,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:48:11,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:48:11" (1/1) ... [2024-11-11 16:48:11,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729e1981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:11, skipping insertion in model container [2024-11-11 16:48:11,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:48:11" (1/1) ... [2024-11-11 16:48:12,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:48:12,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c[7865,7878] [2024-11-11 16:48:12,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:48:12,418 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:48:12,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c[7865,7878] [2024-11-11 16:48:12,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:48:12,534 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:48:12,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12 WrapperNode [2024-11-11 16:48:12,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:48:12,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:48:12,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:48:12,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:48:12,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,638 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-11 16:48:12,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:48:12,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:48:12,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:48:12,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:48:12,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,711 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:48:12,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:48:12,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:48:12,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:48:12,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:48:12,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (1/1) ... [2024-11-11 16:48:12,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:48:12,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:12,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:48:12,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:48:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:48:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:48:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:48:12,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:48:12,888 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:48:12,889 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:48:14,069 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-11 16:48:14,070 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:48:14,093 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:48:14,093 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:48:14,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:14 BoogieIcfgContainer [2024-11-11 16:48:14,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:48:14,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:48:14,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:48:14,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:48:14,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:48:11" (1/3) ... [2024-11-11 16:48:14,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a53a0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:48:14, skipping insertion in model container [2024-11-11 16:48:14,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:12" (2/3) ... [2024-11-11 16:48:14,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a53a0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:48:14, skipping insertion in model container [2024-11-11 16:48:14,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:14" (3/3) ... [2024-11-11 16:48:14,102 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label02.c [2024-11-11 16:48:14,116 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:48:14,116 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:48:14,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:48:14,183 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;@7cd6930a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:48:14,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:48:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 16:48:14,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:14,195 INFO L218 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] [2024-11-11 16:48:14,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:14,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1425694346, now seen corresponding path program 1 times [2024-11-11 16:48:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:14,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74131522] [2024-11-11 16:48:14,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:14,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74131522] [2024-11-11 16:48:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74131522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:14,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:14,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:14,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730690935] [2024-11-11 16:48:14,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:14,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:14,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:14,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:14,613 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:15,390 INFO L93 Difference]: Finished difference Result 769 states and 1360 transitions. [2024-11-11 16:48:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:15,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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 54 [2024-11-11 16:48:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:15,401 INFO L225 Difference]: With dead ends: 769 [2024-11-11 16:48:15,401 INFO L226 Difference]: Without dead ends: 422 [2024-11-11 16:48:15,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:15,407 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 186 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:15,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 163 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:48:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-11 16:48:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2024-11-11 16:48:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2024-11-11 16:48:15,450 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 54 [2024-11-11 16:48:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2024-11-11 16:48:15,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2024-11-11 16:48:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 16:48:15,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:15,454 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:15,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:48:15,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:15,455 INFO L85 PathProgramCache]: Analyzing trace with hash 808427271, now seen corresponding path program 1 times [2024-11-11 16:48:15,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:15,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860999505] [2024-11-11 16:48:15,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:15,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:15,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860999505] [2024-11-11 16:48:15,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860999505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:15,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:15,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:15,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135798803] [2024-11-11 16:48:15,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:15,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:15,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:15,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:15,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:15,586 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:16,217 INFO L93 Difference]: Finished difference Result 1194 states and 1821 transitions. [2024-11-11 16:48:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:16,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120 [2024-11-11 16:48:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:16,221 INFO L225 Difference]: With dead ends: 1194 [2024-11-11 16:48:16,221 INFO L226 Difference]: Without dead ends: 784 [2024-11-11 16:48:16,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:16,231 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:16,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 154 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-11 16:48:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2024-11-11 16:48:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.3742017879948913) internal successors, (1076), 783 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1076 transitions. [2024-11-11 16:48:16,299 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1076 transitions. Word has length 120 [2024-11-11 16:48:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:16,299 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1076 transitions. [2024-11-11 16:48:16,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1076 transitions. [2024-11-11 16:48:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 16:48:16,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:16,305 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:16,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:48:16,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:16,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1746590275, now seen corresponding path program 1 times [2024-11-11 16:48:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:16,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720390428] [2024-11-11 16:48:16,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:16,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720390428] [2024-11-11 16:48:16,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720390428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:16,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:16,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916941698] [2024-11-11 16:48:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:16,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:16,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:16,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:16,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:16,589 INFO L87 Difference]: Start difference. First operand 784 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:17,180 INFO L93 Difference]: Finished difference Result 1936 states and 2599 transitions. [2024-11-11 16:48:17,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:17,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2024-11-11 16:48:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:17,186 INFO L225 Difference]: With dead ends: 1936 [2024-11-11 16:48:17,188 INFO L226 Difference]: Without dead ends: 1154 [2024-11-11 16:48:17,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:17,193 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:17,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:48:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-11 16:48:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1153. [2024-11-11 16:48:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.2699652777777777) internal successors, (1463), 1152 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1463 transitions. [2024-11-11 16:48:17,267 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1463 transitions. Word has length 124 [2024-11-11 16:48:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:17,271 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1463 transitions. [2024-11-11 16:48:17,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1463 transitions. [2024-11-11 16:48:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-11 16:48:17,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:17,287 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:17,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:48:17,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:17,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash -948152282, now seen corresponding path program 1 times [2024-11-11 16:48:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:17,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649536799] [2024-11-11 16:48:17,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:17,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-11 16:48:17,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649536799] [2024-11-11 16:48:17,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649536799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:17,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:17,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:17,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018742276] [2024-11-11 16:48:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:17,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:17,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:17,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:17,533 INFO L87 Difference]: Start difference. First operand 1153 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:18,142 INFO L93 Difference]: Finished difference Result 2494 states and 3189 transitions. [2024-11-11 16:48:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:18,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 166 [2024-11-11 16:48:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:18,146 INFO L225 Difference]: With dead ends: 2494 [2024-11-11 16:48:18,146 INFO L226 Difference]: Without dead ends: 1527 [2024-11-11 16:48:18,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:18,148 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 106 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:18,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 154 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-11-11 16:48:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2024-11-11 16:48:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2557377049180327) internal successors, (1915), 1525 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1915 transitions. [2024-11-11 16:48:18,186 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1915 transitions. Word has length 166 [2024-11-11 16:48:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:18,186 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1915 transitions. [2024-11-11 16:48:18,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1915 transitions. [2024-11-11 16:48:18,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-11 16:48:18,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:18,188 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:18,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:48:18,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:18,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:18,189 INFO L85 PathProgramCache]: Analyzing trace with hash -728761857, now seen corresponding path program 1 times [2024-11-11 16:48:18,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:18,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838935432] [2024-11-11 16:48:18,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:18,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:18,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838935432] [2024-11-11 16:48:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838935432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:18,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:18,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760838762] [2024-11-11 16:48:18,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:18,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:18,427 INFO L87 Difference]: Start difference. First operand 1526 states and 1915 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:19,048 INFO L93 Difference]: Finished difference Result 2864 states and 3636 transitions. [2024-11-11 16:48:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:19,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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 181 [2024-11-11 16:48:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:19,054 INFO L225 Difference]: With dead ends: 2864 [2024-11-11 16:48:19,054 INFO L226 Difference]: Without dead ends: 1524 [2024-11-11 16:48:19,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:19,057 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 181 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:19,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 306 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-11 16:48:19,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1524. [2024-11-11 16:48:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1523 states have (on average 1.2107682206172028) internal successors, (1844), 1523 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1844 transitions. [2024-11-11 16:48:19,077 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1844 transitions. Word has length 181 [2024-11-11 16:48:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:19,078 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 1844 transitions. [2024-11-11 16:48:19,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1844 transitions. [2024-11-11 16:48:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-11 16:48:19,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:19,083 INFO L218 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, 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] [2024-11-11 16:48:19,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:48:19,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:19,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash -845047207, now seen corresponding path program 1 times [2024-11-11 16:48:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:19,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389032746] [2024-11-11 16:48:19,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:19,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:48:19,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:19,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389032746] [2024-11-11 16:48:19,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389032746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:19,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:19,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:19,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102590206] [2024-11-11 16:48:19,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:19,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:19,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:19,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:19,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:19,310 INFO L87 Difference]: Start difference. First operand 1524 states and 1844 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:19,928 INFO L93 Difference]: Finished difference Result 3603 states and 4427 transitions. [2024-11-11 16:48:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:19,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 236 [2024-11-11 16:48:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:19,933 INFO L225 Difference]: With dead ends: 3603 [2024-11-11 16:48:19,934 INFO L226 Difference]: Without dead ends: 2265 [2024-11-11 16:48:19,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:19,935 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 143 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:19,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 386 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-11-11 16:48:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2076. [2024-11-11 16:48:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 2075 states have (on average 1.192289156626506) internal successors, (2474), 2075 states have internal predecessors, (2474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2474 transitions. [2024-11-11 16:48:19,958 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2474 transitions. Word has length 236 [2024-11-11 16:48:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:19,958 INFO L471 AbstractCegarLoop]: Abstraction has 2076 states and 2474 transitions. [2024-11-11 16:48:19,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2474 transitions. [2024-11-11 16:48:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-11 16:48:19,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:19,961 INFO L218 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, 2, 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] [2024-11-11 16:48:19,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:48:19,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:19,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:19,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1327280490, now seen corresponding path program 1 times [2024-11-11 16:48:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:19,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024418602] [2024-11-11 16:48:19,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-11 16:48:20,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:20,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024418602] [2024-11-11 16:48:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024418602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:20,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:20,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163455823] [2024-11-11 16:48:20,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:20,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:20,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:20,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:20,173 INFO L87 Difference]: Start difference. First operand 2076 states and 2474 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:20,842 INFO L93 Difference]: Finished difference Result 4890 states and 5877 transitions. [2024-11-11 16:48:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 242 [2024-11-11 16:48:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:20,850 INFO L225 Difference]: With dead ends: 4890 [2024-11-11 16:48:20,850 INFO L226 Difference]: Without dead ends: 2816 [2024-11-11 16:48:20,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:20,853 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 142 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:20,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 387 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2024-11-11 16:48:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2811. [2024-11-11 16:48:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2811 states, 2810 states have (on average 1.1736654804270463) internal successors, (3298), 2810 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 3298 transitions. [2024-11-11 16:48:20,884 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 3298 transitions. Word has length 242 [2024-11-11 16:48:20,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:20,885 INFO L471 AbstractCegarLoop]: Abstraction has 2811 states and 3298 transitions. [2024-11-11 16:48:20,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 3298 transitions. [2024-11-11 16:48:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-11 16:48:20,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:20,888 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:48:20,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:48:20,889 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:20,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:20,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1752037152, now seen corresponding path program 1 times [2024-11-11 16:48:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:20,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999037364] [2024-11-11 16:48:20,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:20,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:21,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:21,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999037364] [2024-11-11 16:48:21,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999037364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:21,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:21,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:21,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115318278] [2024-11-11 16:48:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:21,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:48:21,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:48:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:21,096 INFO L87 Difference]: Start difference. First operand 2811 states and 3298 transitions. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:22,144 INFO L93 Difference]: Finished difference Result 8956 states and 10588 transitions. [2024-11-11 16:48:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:48:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 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 281 [2024-11-11 16:48:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:22,160 INFO L225 Difference]: With dead ends: 8956 [2024-11-11 16:48:22,160 INFO L226 Difference]: Without dead ends: 6147 [2024-11-11 16:48:22,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:22,164 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 284 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:22,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 78 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:48:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2024-11-11 16:48:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 5961. [2024-11-11 16:48:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5961 states, 5960 states have (on average 1.1758389261744966) internal successors, (7008), 5960 states have internal predecessors, (7008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 7008 transitions. [2024-11-11 16:48:22,226 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 7008 transitions. Word has length 281 [2024-11-11 16:48:22,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:22,226 INFO L471 AbstractCegarLoop]: Abstraction has 5961 states and 7008 transitions. [2024-11-11 16:48:22,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 7008 transitions. [2024-11-11 16:48:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-11 16:48:22,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:22,233 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:22,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:48:22,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:22,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:22,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1184279150, now seen corresponding path program 1 times [2024-11-11 16:48:22,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:22,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305183569] [2024-11-11 16:48:22,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-11 16:48:22,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:22,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305183569] [2024-11-11 16:48:22,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305183569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:22,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:22,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285244154] [2024-11-11 16:48:22,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:22,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:22,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:22,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:22,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:22,405 INFO L87 Difference]: Start difference. First operand 5961 states and 7008 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:23,032 INFO L93 Difference]: Finished difference Result 12099 states and 14259 transitions. [2024-11-11 16:48:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 319 [2024-11-11 16:48:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:23,048 INFO L225 Difference]: With dead ends: 12099 [2024-11-11 16:48:23,048 INFO L226 Difference]: Without dead ends: 7248 [2024-11-11 16:48:23,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:23,054 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 168 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:23,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 146 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7248 states. [2024-11-11 16:48:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7248 to 4664. [2024-11-11 16:48:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4664 states, 4663 states have (on average 1.1799270855672315) internal successors, (5502), 4663 states have internal predecessors, (5502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 5502 transitions. [2024-11-11 16:48:23,111 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 5502 transitions. Word has length 319 [2024-11-11 16:48:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:23,111 INFO L471 AbstractCegarLoop]: Abstraction has 4664 states and 5502 transitions. [2024-11-11 16:48:23,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 5502 transitions. [2024-11-11 16:48:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-11 16:48:23,116 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:23,117 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:48:23,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:48:23,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:23,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1130496183, now seen corresponding path program 1 times [2024-11-11 16:48:23,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:23,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231033177] [2024-11-11 16:48:23,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:23,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:23,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231033177] [2024-11-11 16:48:23,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231033177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:23,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262858007] [2024-11-11 16:48:23,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:23,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:23,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:23,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:48:23,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:48:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:23,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 16:48:23,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:48:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:25,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:48:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262858007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:48:26,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:48:26,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-11 16:48:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477852694] [2024-11-11 16:48:26,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:48:26,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 16:48:26,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:26,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 16:48:26,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:48:26,718 INFO L87 Difference]: Start difference. First operand 4664 states and 5502 transitions. Second operand has 8 states, 8 states have (on average 72.5) internal successors, (580), 7 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-11-11 16:48:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:29,020 INFO L93 Difference]: Finished difference Result 12139 states and 14292 transitions. [2024-11-11 16:48:29,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 16:48:29,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 72.5) internal successors, (580), 7 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 328 [2024-11-11 16:48:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:29,058 INFO L225 Difference]: With dead ends: 12139 [2024-11-11 16:48:29,058 INFO L226 Difference]: Without dead ends: 7845 [2024-11-11 16:48:29,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-11 16:48:29,061 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 897 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 3057 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 3057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:29,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 190 Invalid, 3406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 3057 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 16:48:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7845 states. [2024-11-11 16:48:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7845 to 4477. [2024-11-11 16:48:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4477 states, 4476 states have (on average 1.1735924932975872) internal successors, (5253), 4476 states have internal predecessors, (5253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 5253 transitions. [2024-11-11 16:48:29,116 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 5253 transitions. Word has length 328 [2024-11-11 16:48:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:29,116 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 5253 transitions. [2024-11-11 16:48:29,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.5) internal successors, (580), 7 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-11-11 16:48:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 5253 transitions. [2024-11-11 16:48:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-11 16:48:29,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:29,122 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:48:29,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:48:29,322 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,SelfDestructingSolverStorable9 [2024-11-11 16:48:29,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:29,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1345956964, now seen corresponding path program 1 times [2024-11-11 16:48:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:29,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973178975] [2024-11-11 16:48:29,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:29,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 188 proven. 148 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-11 16:48:30,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:30,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973178975] [2024-11-11 16:48:30,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973178975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:30,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889571797] [2024-11-11 16:48:30,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:30,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:30,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:30,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:48:30,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:48:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:30,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:48:30,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:48:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-11 16:48:30,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:48:30,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889571797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:30,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:48:30,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-11 16:48:30,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828837529] [2024-11-11 16:48:30,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:30,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:30,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:30,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:30,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:48:30,421 INFO L87 Difference]: Start difference. First operand 4477 states and 5253 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:31,028 INFO L93 Difference]: Finished difference Result 8778 states and 10330 transitions. [2024-11-11 16:48:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2024-11-11 16:48:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:31,035 INFO L225 Difference]: With dead ends: 8778 [2024-11-11 16:48:31,035 INFO L226 Difference]: Without dead ends: 4671 [2024-11-11 16:48:31,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:48:31,038 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 103 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:31,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 324 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2024-11-11 16:48:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4477. [2024-11-11 16:48:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4477 states, 4476 states have (on average 1.1427613941018766) internal successors, (5115), 4476 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 5115 transitions. [2024-11-11 16:48:31,088 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 5115 transitions. Word has length 348 [2024-11-11 16:48:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:31,089 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 5115 transitions. [2024-11-11 16:48:31,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 5115 transitions. [2024-11-11 16:48:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-11 16:48:31,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:31,096 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:48:31,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 16:48:31,296 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,SelfDestructingSolverStorable10 [2024-11-11 16:48:31,297 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:31,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash -87231958, now seen corresponding path program 1 times [2024-11-11 16:48:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:31,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52247511] [2024-11-11 16:48:31,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:31,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:31,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52247511] [2024-11-11 16:48:31,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52247511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:31,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:31,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:31,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753610185] [2024-11-11 16:48:31,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:31,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:31,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:31,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:31,628 INFO L87 Difference]: Start difference. First operand 4477 states and 5115 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:32,225 INFO L93 Difference]: Finished difference Result 11713 states and 13473 transitions. [2024-11-11 16:48:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:32,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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 356 [2024-11-11 16:48:32,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:32,236 INFO L225 Difference]: With dead ends: 11713 [2024-11-11 16:48:32,236 INFO L226 Difference]: Without dead ends: 7606 [2024-11-11 16:48:32,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:32,240 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:32,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 70 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2024-11-11 16:48:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7601. [2024-11-11 16:48:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7601 states, 7600 states have (on average 1.137763157894737) internal successors, (8647), 7600 states have internal predecessors, (8647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7601 states to 7601 states and 8647 transitions. [2024-11-11 16:48:32,306 INFO L78 Accepts]: Start accepts. Automaton has 7601 states and 8647 transitions. Word has length 356 [2024-11-11 16:48:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:32,306 INFO L471 AbstractCegarLoop]: Abstraction has 7601 states and 8647 transitions. [2024-11-11 16:48:32,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 7601 states and 8647 transitions. [2024-11-11 16:48:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-11 16:48:32,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:32,312 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:32,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:48:32,312 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:32,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2000820814, now seen corresponding path program 1 times [2024-11-11 16:48:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:32,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846829470] [2024-11-11 16:48:32,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-11 16:48:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846829470] [2024-11-11 16:48:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846829470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611829958] [2024-11-11 16:48:32,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:32,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:32,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:32,839 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:48:32,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 16:48:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:33,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:48:33,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:48:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-11 16:48:33,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:48:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-11 16:48:34,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611829958] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:34,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:48:34,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-11 16:48:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143381112] [2024-11-11 16:48:34,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:34,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:34,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:48:34,674 INFO L87 Difference]: Start difference. First operand 7601 states and 8647 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:35,274 INFO L93 Difference]: Finished difference Result 17036 states and 19446 transitions. [2024-11-11 16:48:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 359 [2024-11-11 16:48:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:35,285 INFO L225 Difference]: With dead ends: 17036 [2024-11-11 16:48:35,285 INFO L226 Difference]: Without dead ends: 9805 [2024-11-11 16:48:35,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:48:35,291 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 174 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:35,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 119 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9805 states. [2024-11-11 16:48:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9805 to 7964. [2024-11-11 16:48:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7964 states, 7963 states have (on average 1.1312319477583825) internal successors, (9008), 7963 states have internal predecessors, (9008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7964 states to 7964 states and 9008 transitions. [2024-11-11 16:48:35,357 INFO L78 Accepts]: Start accepts. Automaton has 7964 states and 9008 transitions. Word has length 359 [2024-11-11 16:48:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:35,357 INFO L471 AbstractCegarLoop]: Abstraction has 7964 states and 9008 transitions. [2024-11-11 16:48:35,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 7964 states and 9008 transitions. [2024-11-11 16:48:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2024-11-11 16:48:35,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:35,364 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:35,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 16:48:35,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:35,569 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:35,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1108276798, now seen corresponding path program 1 times [2024-11-11 16:48:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:35,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782461396] [2024-11-11 16:48:35,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:35,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-11 16:48:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782461396] [2024-11-11 16:48:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782461396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:36,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:36,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:36,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335916378] [2024-11-11 16:48:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:36,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:36,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:36,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:36,089 INFO L87 Difference]: Start difference. First operand 7964 states and 9008 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:36,813 INFO L93 Difference]: Finished difference Result 17029 states and 19297 transitions. [2024-11-11 16:48:36,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:36,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 446 [2024-11-11 16:48:36,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:36,836 INFO L225 Difference]: With dead ends: 17029 [2024-11-11 16:48:36,836 INFO L226 Difference]: Without dead ends: 9435 [2024-11-11 16:48:36,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:36,850 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 101 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:36,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 322 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:48:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9435 states. [2024-11-11 16:48:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9435 to 7587. [2024-11-11 16:48:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7587 states, 7586 states have (on average 1.119825995254416) internal successors, (8495), 7586 states have internal predecessors, (8495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7587 states to 7587 states and 8495 transitions. [2024-11-11 16:48:36,994 INFO L78 Accepts]: Start accepts. Automaton has 7587 states and 8495 transitions. Word has length 446 [2024-11-11 16:48:36,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:36,995 INFO L471 AbstractCegarLoop]: Abstraction has 7587 states and 8495 transitions. [2024-11-11 16:48:36,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7587 states and 8495 transitions. [2024-11-11 16:48:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-11-11 16:48:37,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:37,011 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 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, 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-11-11 16:48:37,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:48:37,011 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:37,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1480841082, now seen corresponding path program 1 times [2024-11-11 16:48:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976189812] [2024-11-11 16:48:37,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:37,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-11 16:48:37,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:37,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976189812] [2024-11-11 16:48:37,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976189812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:37,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:37,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:37,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836779541] [2024-11-11 16:48:37,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:37,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:37,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:37,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:37,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:37,736 INFO L87 Difference]: Start difference. First operand 7587 states and 8495 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:38,389 INFO L93 Difference]: Finished difference Result 15359 states and 17218 transitions. [2024-11-11 16:48:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:38,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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 480 [2024-11-11 16:48:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:38,398 INFO L225 Difference]: With dead ends: 15359 [2024-11-11 16:48:38,398 INFO L226 Difference]: Without dead ends: 7958 [2024-11-11 16:48:38,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:38,404 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 89 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:38,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 172 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7958 states. [2024-11-11 16:48:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7958 to 7955. [2024-11-11 16:48:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7955 states, 7954 states have (on average 1.1079959768669851) internal successors, (8813), 7954 states have internal predecessors, (8813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7955 states to 7955 states and 8813 transitions. [2024-11-11 16:48:38,458 INFO L78 Accepts]: Start accepts. Automaton has 7955 states and 8813 transitions. Word has length 480 [2024-11-11 16:48:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:38,458 INFO L471 AbstractCegarLoop]: Abstraction has 7955 states and 8813 transitions. [2024-11-11 16:48:38,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 7955 states and 8813 transitions. [2024-11-11 16:48:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-11-11 16:48:38,465 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:38,466 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:38,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 16:48:38,466 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:38,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:38,466 INFO L85 PathProgramCache]: Analyzing trace with hash -380186503, now seen corresponding path program 1 times [2024-11-11 16:48:38,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:38,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869109513] [2024-11-11 16:48:38,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-11 16:48:38,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:38,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869109513] [2024-11-11 16:48:38,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869109513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:38,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:38,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:48:38,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153739644] [2024-11-11 16:48:38,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:38,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:48:38,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:38,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:48:38,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:38,846 INFO L87 Difference]: Start difference. First operand 7955 states and 8813 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:39,666 INFO L93 Difference]: Finished difference Result 17379 states and 19317 transitions. [2024-11-11 16:48:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:48:39,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 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 481 [2024-11-11 16:48:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:39,675 INFO L225 Difference]: With dead ends: 17379 [2024-11-11 16:48:39,675 INFO L226 Difference]: Without dead ends: 9794 [2024-11-11 16:48:39,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:39,681 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 285 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:39,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 153 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:48:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9794 states. [2024-11-11 16:48:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9794 to 8874. [2024-11-11 16:48:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8874 states, 8873 states have (on average 1.1000788910176942) internal successors, (9761), 8873 states have internal predecessors, (9761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8874 states to 8874 states and 9761 transitions. [2024-11-11 16:48:39,743 INFO L78 Accepts]: Start accepts. Automaton has 8874 states and 9761 transitions. Word has length 481 [2024-11-11 16:48:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:39,743 INFO L471 AbstractCegarLoop]: Abstraction has 8874 states and 9761 transitions. [2024-11-11 16:48:39,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 8874 states and 9761 transitions. [2024-11-11 16:48:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2024-11-11 16:48:39,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:39,752 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-11 16:48:39,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 16:48:39,752 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash -914071402, now seen corresponding path program 1 times [2024-11-11 16:48:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462579840] [2024-11-11 16:48:39,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 578 proven. 133 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-11 16:48:40,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462579840] [2024-11-11 16:48:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462579840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25730766] [2024-11-11 16:48:40,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:40,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:40,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:48:40,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 16:48:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:40,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:48:40,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:48:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-11 16:48:40,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:48:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25730766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:40,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:48:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 16:48:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594834296] [2024-11-11 16:48:40,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:40,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:40,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:40,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:40,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:48:40,653 INFO L87 Difference]: Start difference. First operand 8874 states and 9761 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:41,230 INFO L93 Difference]: Finished difference Result 18305 states and 20183 transitions. [2024-11-11 16:48:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:41,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 518 [2024-11-11 16:48:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:41,239 INFO L225 Difference]: With dead ends: 18305 [2024-11-11 16:48:41,239 INFO L226 Difference]: Without dead ends: 9801 [2024-11-11 16:48:41,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 518 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-11-11 16:48:41,248 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 93 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:41,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 329 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:48:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9801 states. [2024-11-11 16:48:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9801 to 9610. [2024-11-11 16:48:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9610 states, 9609 states have (on average 1.0999063378083047) internal successors, (10569), 9609 states have internal predecessors, (10569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9610 states to 9610 states and 10569 transitions. [2024-11-11 16:48:41,368 INFO L78 Accepts]: Start accepts. Automaton has 9610 states and 10569 transitions. Word has length 518 [2024-11-11 16:48:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:41,369 INFO L471 AbstractCegarLoop]: Abstraction has 9610 states and 10569 transitions. [2024-11-11 16:48:41,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 9610 states and 10569 transitions. [2024-11-11 16:48:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-11 16:48:41,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:41,385 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:48:41,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 16:48:41,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 16:48:41,590 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:41,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 978702432, now seen corresponding path program 1 times [2024-11-11 16:48:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:41,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261071699] [2024-11-11 16:48:41,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:41,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-11 16:48:41,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:41,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261071699] [2024-11-11 16:48:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261071699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:41,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:41,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109859167] [2024-11-11 16:48:41,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:41,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:41,991 INFO L87 Difference]: Start difference. First operand 9610 states and 10569 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:42,593 INFO L93 Difference]: Finished difference Result 20509 states and 22627 transitions. [2024-11-11 16:48:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:42,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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 572 [2024-11-11 16:48:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:42,602 INFO L225 Difference]: With dead ends: 20509 [2024-11-11 16:48:42,602 INFO L226 Difference]: Without dead ends: 11269 [2024-11-11 16:48:42,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:42,607 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 120 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:42,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 73 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11269 states. [2024-11-11 16:48:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 9426. [2024-11-11 16:48:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9426 states, 9425 states have (on average 1.0980371352785145) internal successors, (10349), 9425 states have internal predecessors, (10349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 10349 transitions. [2024-11-11 16:48:42,680 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 10349 transitions. Word has length 572 [2024-11-11 16:48:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:42,680 INFO L471 AbstractCegarLoop]: Abstraction has 9426 states and 10349 transitions. [2024-11-11 16:48:42,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 10349 transitions. [2024-11-11 16:48:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2024-11-11 16:48:42,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:42,692 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-11 16:48:42,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 16:48:42,693 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:42,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash 47691538, now seen corresponding path program 1 times [2024-11-11 16:48:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:42,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799057296] [2024-11-11 16:48:42,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2024-11-11 16:48:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799057296] [2024-11-11 16:48:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799057296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:43,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:43,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:43,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298118423] [2024-11-11 16:48:43,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:43,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:48:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:43,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:48:43,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:43,206 INFO L87 Difference]: Start difference. First operand 9426 states and 10349 transitions. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:44,006 INFO L93 Difference]: Finished difference Result 20333 states and 22350 transitions. [2024-11-11 16:48:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:48:44,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 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 682 [2024-11-11 16:48:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:44,015 INFO L225 Difference]: With dead ends: 20333 [2024-11-11 16:48:44,015 INFO L226 Difference]: Without dead ends: 11092 [2024-11-11 16:48:44,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:44,020 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 230 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:44,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 66 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:48:44,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11092 states. [2024-11-11 16:48:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11092 to 8506. [2024-11-11 16:48:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8506 states, 8505 states have (on average 1.0979423868312757) internal successors, (9338), 8505 states have internal predecessors, (9338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 9338 transitions. [2024-11-11 16:48:44,094 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 9338 transitions. Word has length 682 [2024-11-11 16:48:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:44,094 INFO L471 AbstractCegarLoop]: Abstraction has 8506 states and 9338 transitions. [2024-11-11 16:48:44,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 9338 transitions. [2024-11-11 16:48:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2024-11-11 16:48:44,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:44,126 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:44,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 16:48:44,126 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:44,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash -534851769, now seen corresponding path program 1 times [2024-11-11 16:48:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431733055] [2024-11-11 16:48:44,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:44,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2242 backedges. 1055 proven. 0 refuted. 0 times theorem prover too weak. 1187 trivial. 0 not checked. [2024-11-11 16:48:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:44,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431733055] [2024-11-11 16:48:44,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431733055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:44,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:44,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589871261] [2024-11-11 16:48:44,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:44,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:48:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:44,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:48:44,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:44,625 INFO L87 Difference]: Start difference. First operand 8506 states and 9338 transitions. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:45,661 INFO L93 Difference]: Finished difference Result 22725 states and 25044 transitions. [2024-11-11 16:48:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:48:45,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 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 774 [2024-11-11 16:48:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:45,672 INFO L225 Difference]: With dead ends: 22725 [2024-11-11 16:48:45,672 INFO L226 Difference]: Without dead ends: 14589 [2024-11-11 16:48:45,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:45,677 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 236 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:45,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 97 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:48:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14589 states. [2024-11-11 16:48:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14589 to 13665. [2024-11-11 16:48:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13665 states, 13664 states have (on average 1.088041569086651) internal successors, (14867), 13664 states have internal predecessors, (14867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13665 states to 13665 states and 14867 transitions. [2024-11-11 16:48:45,773 INFO L78 Accepts]: Start accepts. Automaton has 13665 states and 14867 transitions. Word has length 774 [2024-11-11 16:48:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:45,773 INFO L471 AbstractCegarLoop]: Abstraction has 13665 states and 14867 transitions. [2024-11-11 16:48:45,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13665 states and 14867 transitions. [2024-11-11 16:48:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2024-11-11 16:48:45,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:45,786 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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] [2024-11-11 16:48:45,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 16:48:45,786 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:45,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash 542249316, now seen corresponding path program 1 times [2024-11-11 16:48:45,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:45,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396339990] [2024-11-11 16:48:45,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1107 proven. 336 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2024-11-11 16:48:47,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396339990] [2024-11-11 16:48:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396339990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773855545] [2024-11-11 16:48:47,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:47,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:47,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:47,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:48:47,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 16:48:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:47,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 16:48:47,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:48:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1429 proven. 380 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2024-11-11 16:48:47,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:48:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1809 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2024-11-11 16:48:48,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773855545] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:48,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:48:48,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 11 [2024-11-11 16:48:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312497526] [2024-11-11 16:48:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:48,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 16:48:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:48,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 16:48:48,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-11 16:48:48,813 INFO L87 Difference]: Start difference. First operand 13665 states and 14867 transitions. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:49,993 INFO L93 Difference]: Finished difference Result 32855 states and 35805 transitions. [2024-11-11 16:48:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:48:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 4 states have internal predecessors, (439), 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 788 [2024-11-11 16:48:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:50,011 INFO L225 Difference]: With dead ends: 32855 [2024-11-11 16:48:50,011 INFO L226 Difference]: Without dead ends: 19560 [2024-11-11 16:48:50,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1580 GetRequests, 1570 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-11 16:48:50,023 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 245 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:50,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 66 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 16:48:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19560 states. [2024-11-11 16:48:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19560 to 17165. [2024-11-11 16:48:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17165 states, 17164 states have (on average 1.0907131204847356) internal successors, (18721), 17164 states have internal predecessors, (18721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17165 states to 17165 states and 18721 transitions. [2024-11-11 16:48:50,248 INFO L78 Accepts]: Start accepts. Automaton has 17165 states and 18721 transitions. Word has length 788 [2024-11-11 16:48:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:50,249 INFO L471 AbstractCegarLoop]: Abstraction has 17165 states and 18721 transitions. [2024-11-11 16:48:50,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 17165 states and 18721 transitions. [2024-11-11 16:48:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2024-11-11 16:48:50,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:50,268 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:50,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 16:48:50,471 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-11-11 16:48:50,472 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:50,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1151524527, now seen corresponding path program 1 times [2024-11-11 16:48:50,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:50,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123067453] [2024-11-11 16:48:50,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2967 backedges. 1261 proven. 0 refuted. 0 times theorem prover too weak. 1706 trivial. 0 not checked. [2024-11-11 16:48:50,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123067453] [2024-11-11 16:48:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123067453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:50,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:50,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780743833] [2024-11-11 16:48:50,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:50,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:50,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:50,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:50,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:50,944 INFO L87 Difference]: Start difference. First operand 17165 states and 18721 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:51,521 INFO L93 Difference]: Finished difference Result 36912 states and 40337 transitions. [2024-11-11 16:48:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:51,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 886 [2024-11-11 16:48:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:51,537 INFO L225 Difference]: With dead ends: 36912 [2024-11-11 16:48:51,538 INFO L226 Difference]: Without dead ends: 20117 [2024-11-11 16:48:51,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:51,549 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 128 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:51,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 132 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:48:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20117 states. [2024-11-11 16:48:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20117 to 18824. [2024-11-11 16:48:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18824 states, 18823 states have (on average 1.0910588110290602) internal successors, (20537), 18823 states have internal predecessors, (20537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 20537 transitions. [2024-11-11 16:48:51,805 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 20537 transitions. Word has length 886 [2024-11-11 16:48:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:51,808 INFO L471 AbstractCegarLoop]: Abstraction has 18824 states and 20537 transitions. [2024-11-11 16:48:51,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 20537 transitions. [2024-11-11 16:48:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2024-11-11 16:48:51,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:51,824 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:51,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 16:48:51,824 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:51,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash 414037878, now seen corresponding path program 1 times [2024-11-11 16:48:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:51,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629485727] [2024-11-11 16:48:51,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:51,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2987 backedges. 1958 proven. 0 refuted. 0 times theorem prover too weak. 1029 trivial. 0 not checked. [2024-11-11 16:48:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629485727] [2024-11-11 16:48:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629485727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:52,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966329436] [2024-11-11 16:48:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:52,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:52,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:52,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:52,264 INFO L87 Difference]: Start difference. First operand 18824 states and 20537 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:52,797 INFO L93 Difference]: Finished difference Result 40036 states and 43744 transitions. [2024-11-11 16:48:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 896 [2024-11-11 16:48:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:52,815 INFO L225 Difference]: With dead ends: 40036 [2024-11-11 16:48:52,815 INFO L226 Difference]: Without dead ends: 21582 [2024-11-11 16:48:52,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:52,826 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 75 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:52,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 300 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:48:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21582 states. [2024-11-11 16:48:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21582 to 13110. [2024-11-11 16:48:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13110 states, 13109 states have (on average 1.0817758791669845) internal successors, (14181), 13109 states have internal predecessors, (14181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13110 states to 13110 states and 14181 transitions. [2024-11-11 16:48:53,126 INFO L78 Accepts]: Start accepts. Automaton has 13110 states and 14181 transitions. Word has length 896 [2024-11-11 16:48:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:53,127 INFO L471 AbstractCegarLoop]: Abstraction has 13110 states and 14181 transitions. [2024-11-11 16:48:53,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 13110 states and 14181 transitions. [2024-11-11 16:48:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2024-11-11 16:48:53,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:53,154 INFO L218 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:53,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 16:48:53,154 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:53,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:53,155 INFO L85 PathProgramCache]: Analyzing trace with hash -111425634, now seen corresponding path program 1 times [2024-11-11 16:48:53,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:53,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355090673] [2024-11-11 16:48:53,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:53,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4578 backedges. 2682 proven. 924 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-11 16:48:55,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355090673] [2024-11-11 16:48:55,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355090673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154622134] [2024-11-11 16:48:55,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:55,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:55,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:55,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:48:55,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 16:48:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:55,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:48:55,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:48:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4578 backedges. 2903 proven. 0 refuted. 0 times theorem prover too weak. 1675 trivial. 0 not checked. [2024-11-11 16:48:55,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:48:55,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154622134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:55,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:48:55,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 16:48:55,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298181775] [2024-11-11 16:48:55,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:55,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:55,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:55,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:48:55,707 INFO L87 Difference]: Start difference. First operand 13110 states and 14181 transitions. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:56,168 INFO L93 Difference]: Finished difference Result 18652 states and 20202 transitions. [2024-11-11 16:48:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:56,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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 1119 [2024-11-11 16:48:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:56,173 INFO L225 Difference]: With dead ends: 18652 [2024-11-11 16:48:56,173 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:48:56,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:48:56,183 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 88 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:56,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 274 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:48:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:48:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:48:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:48:56,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1119 [2024-11-11 16:48:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:56,188 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:48:56,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:48:56,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:48:56,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:48:56,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 16:48:56,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:56,395 INFO L421 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, 1] [2024-11-11 16:48:56,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:49:06,928 WARN L286 SmtUtils]: Spent 10.53s on a formula simplification. DAG size of input: 383 DAG size of output: 410 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-11 16:49:08,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:49:08,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:49:08 BoogieIcfgContainer [2024-11-11 16:49:08,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:49:08,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:49:08,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:49:08,554 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:49:08,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:14" (3/4) ... [2024-11-11 16:49:08,556 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:49:08,573 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:49:08,574 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:49:08,575 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:49:08,576 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:49:08,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:49:08,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:49:08,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:49:08,712 INFO L158 Benchmark]: Toolchain (without parser) took 56744.48ms. Allocated memory was 178.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 100.6MB in the beginning and 751.5MB in the end (delta: -650.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-11 16:49:08,712 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:49:08,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.46ms. Allocated memory was 178.3MB in the beginning and 285.2MB in the end (delta: 107.0MB). Free memory was 100.4MB in the beginning and 222.2MB in the end (delta: -121.8MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.32ms. Allocated memory is still 285.2MB. Free memory was 222.2MB in the beginning and 204.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,713 INFO L158 Benchmark]: Boogie Preprocessor took 129.18ms. Allocated memory is still 285.2MB. Free memory was 204.4MB in the beginning and 179.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,714 INFO L158 Benchmark]: RCFGBuilder took 1325.14ms. Allocated memory is still 285.2MB. Free memory was 179.2MB in the beginning and 157.5MB in the end (delta: 21.7MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,714 INFO L158 Benchmark]: TraceAbstraction took 54457.74ms. Allocated memory was 285.2MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 157.5MB in the beginning and 768.3MB in the end (delta: -610.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-11 16:49:08,714 INFO L158 Benchmark]: Witness Printer took 158.13ms. Allocated memory is still 1.9GB. Free memory was 768.3MB in the beginning and 751.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,715 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.11ms. Allocated memory is still 178.3MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.46ms. Allocated memory was 178.3MB in the beginning and 285.2MB in the end (delta: 107.0MB). Free memory was 100.4MB in the beginning and 222.2MB in the end (delta: -121.8MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.32ms. Allocated memory is still 285.2MB. Free memory was 222.2MB in the beginning and 204.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.18ms. Allocated memory is still 285.2MB. Free memory was 204.4MB in the beginning and 179.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1325.14ms. Allocated memory is still 285.2MB. Free memory was 179.2MB in the beginning and 157.5MB in the end (delta: 21.7MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. * TraceAbstraction took 54457.74ms. Allocated memory was 285.2MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 157.5MB in the beginning and 768.3MB in the end (delta: -610.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 158.13ms. Allocated memory is still 1.9GB. Free memory was 768.3MB in the beginning and 751.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 178]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.2s, OverallIterations: 24, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4425 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4425 mSDsluCounter, 4651 SdHoareTripleChecker+Invalid, 14.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 571 mSDsCounter, 2827 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17772 IncrementalHoareTripleChecker+Invalid, 20599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2827 mSolverCounterUnsat, 4080 mSDtfsCounter, 17772 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5019 GetRequests, 4953 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18824occurred in iteration=22, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 28859 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 14216 NumberOfCodeBlocks, 14216 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 15658 ConstructedInterpolants, 0 QuantifiedInterpolants, 51665 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4527 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 33 InterpolantComputations, 23 PerfectInterpolantSequences, 32263/34519 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: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (246 <= a29)) || (((((((((a25 == 12) && (307 <= a23)) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (130 <= a29))) || ((((((((a25 == 11) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 11) && (a29 <= 274)) && (((long long) 119992 + a23) <= 0)) && (a4 == 1))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 274)) && (a4 == 1))) || (((((260 <= a29) && (a25 == 11)) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || (((((a25 == 13) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a4 == 1)) && (a8 == 15))) || ((((((((a25 == 12) && (307 <= a23)) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) || ((((long long) a23 + 43) <= 0) && ((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) || (((a29 <= 140) && (a4 == 0)) && (a25 == 10))))) || (((((a25 == 11) && (a29 <= 274)) && (a4 == 1)) && (a23 <= 312)) && (246 <= a29))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a29 <= 274)) && (246 <= a29))) || ((((((long long) a23 + 43) <= 0) && (a29 <= 275)) && (a25 == 12)) && (a4 == 0))) || ((((a25 <= 10) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) || (((((a25 == 13) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 12) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a4 == 0)) && (a25 == 9))) || ((((260 <= a29) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a25 <= 9))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:49:08,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE