./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label59.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/Problem13_label59.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 e95469d39d3368d14177394b02d3829b8d37dd10304149f6e91cf64fc01c6cbc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:02:48,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:02:49,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:02:49,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:02:49,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:02:49,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:02:49,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:02:49,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:02:49,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:02:49,057 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:02:49,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:02:49,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:02:49,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:02:49,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:02:49,060 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:02:49,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:02:49,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:02:49,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:02:49,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:02:49,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:02:49,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:02:49,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:02:49,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:02:49,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:02:49,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:02:49,067 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:02:49,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:02:49,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:02:49,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:02:49,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:02:49,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:02:49,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:02:49,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:02:49,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:02:49,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:02:49,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:02:49,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:02:49,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:02:49,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:02:49,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:02:49,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:02:49,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:02:49,072 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 -> e95469d39d3368d14177394b02d3829b8d37dd10304149f6e91cf64fc01c6cbc [2024-11-11 17:02:49,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:02:49,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:02:49,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:02:49,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:02:49,362 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:02:49,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label59.c [2024-11-11 17:02:50,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:02:51,209 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:02:51,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label59.c [2024-11-11 17:02:51,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b8cae13/3266899ab7f544eb915c0a68cc60d1cd/FLAG4528893e7 [2024-11-11 17:02:51,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b8cae13/3266899ab7f544eb915c0a68cc60d1cd [2024-11-11 17:02:51,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:02:51,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:02:51,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:02:51,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:02:51,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:02:51,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:02:51" (1/1) ... [2024-11-11 17:02:51,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3caed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:51, skipping insertion in model container [2024-11-11 17:02:51,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:02:51" (1/1) ... [2024-11-11 17:02:51,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:02:51,742 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/Problem13_label59.c[6607,6620] [2024-11-11 17:02:52,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:02:52,605 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:02:52,635 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/Problem13_label59.c[6607,6620] [2024-11-11 17:02:53,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:02:53,152 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:02:53,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53 WrapperNode [2024-11-11 17:02:53,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:02:53,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:02:53,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:02:53,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:02:53,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:53,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:53,861 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-11 17:02:53,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:02:53,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:02:53,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:02:53,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:02:53,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:53,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:54,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:54,415 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 17:02:54,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:54,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:54,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:54,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:54,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:54,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:54,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:02:54,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:02:54,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:02:54,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:02:54,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (1/1) ... [2024-11-11 17:02:54,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:02:54,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:02:54,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 17:02:54,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 17:02:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:02:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:02:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:02:54,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:02:54,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:02:54,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:03:01,027 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-11 17:03:01,028 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:03:01,077 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:03:01,078 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:03:01,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:03:01 BoogieIcfgContainer [2024-11-11 17:03:01,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:03:01,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:03:01,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:03:01,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:03:01,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:02:51" (1/3) ... [2024-11-11 17:03:01,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d84537a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:03:01, skipping insertion in model container [2024-11-11 17:03:01,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:02:53" (2/3) ... [2024-11-11 17:03:01,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d84537a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:03:01, skipping insertion in model container [2024-11-11 17:03:01,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:03:01" (3/3) ... [2024-11-11 17:03:01,089 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label59.c [2024-11-11 17:03:01,105 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:03:01,106 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:03:01,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:03:01,219 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;@4a09dec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:03:01,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:03:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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 17:03:01,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 17:03:01,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:01,236 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] [2024-11-11 17:03:01,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:01,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash 291089130, now seen corresponding path program 1 times [2024-11-11 17:03:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:01,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284587037] [2024-11-11 17:03:01,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:01,620 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 17:03:01,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:01,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284587037] [2024-11-11 17:03:01,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284587037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:01,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:01,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:03:01,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041716605] [2024-11-11 17:03:01,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:01,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:01,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:01,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:01,657 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 17:03:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:06,400 INFO L93 Difference]: Finished difference Result 3160 states and 5843 transitions. [2024-11-11 17:03:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:06,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-11 17:03:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:06,427 INFO L225 Difference]: With dead ends: 3160 [2024-11-11 17:03:06,428 INFO L226 Difference]: Without dead ends: 1983 [2024-11-11 17:03:06,435 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 17:03:06,439 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1057 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:06,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 340 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-11 17:03:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-11-11 17:03:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2024-11-11 17:03:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 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 17:03:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2024-11-11 17:03:06,576 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 46 [2024-11-11 17:03:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:06,577 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2024-11-11 17:03:06,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 17:03:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2024-11-11 17:03:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 17:03:06,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:06,581 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, 1, 1, 1, 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 17:03:06,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:03:06,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:06,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:06,583 INFO L85 PathProgramCache]: Analyzing trace with hash -928496590, now seen corresponding path program 1 times [2024-11-11 17:03:06,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:06,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287121766] [2024-11-11 17:03:06,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:06,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:06,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:06,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287121766] [2024-11-11 17:03:06,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287121766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:06,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:06,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:03:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521043065] [2024-11-11 17:03:06,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:06,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:06,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:06,907 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 17:03:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:10,433 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2024-11-11 17:03:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-11 17:03:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:10,449 INFO L225 Difference]: With dead ends: 5456 [2024-11-11 17:03:10,449 INFO L226 Difference]: Without dead ends: 3528 [2024-11-11 17:03:10,453 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 17:03:10,454 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:10,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1007 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-11 17:03:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2024-11-11 17:03:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2024-11-11 17:03:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 0 states have call successors, (0), 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 17:03:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2024-11-11 17:03:10,525 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 111 [2024-11-11 17:03:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:10,527 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2024-11-11 17:03:10,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 17:03:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2024-11-11 17:03:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 17:03:10,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:10,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:10,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:03:10,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:10,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2127816963, now seen corresponding path program 1 times [2024-11-11 17:03:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:10,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890556663] [2024-11-11 17:03:10,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:10,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:10,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:10,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890556663] [2024-11-11 17:03:10,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890556663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:10,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:10,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:03:10,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357936447] [2024-11-11 17:03:10,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:10,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:10,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:10,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:10,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:10,758 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 17:03:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:14,090 INFO L93 Difference]: Finished difference Result 10234 states and 16098 transitions. [2024-11-11 17:03:14,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:14,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-11 17:03:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:14,116 INFO L225 Difference]: With dead ends: 10234 [2024-11-11 17:03:14,117 INFO L226 Difference]: Without dead ends: 6710 [2024-11-11 17:03:14,122 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 17:03:14,124 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 973 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:14,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 852 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 17:03:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2024-11-11 17:03:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6700. [2024-11-11 17:03:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 0 states have call successors, (0), 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 17:03:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2024-11-11 17:03:14,248 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 117 [2024-11-11 17:03:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:14,249 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2024-11-11 17:03:14,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 17:03:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2024-11-11 17:03:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 17:03:14,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:14,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:14,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:03:14,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:14,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1371058456, now seen corresponding path program 1 times [2024-11-11 17:03:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397261921] [2024-11-11 17:03:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:14,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397261921] [2024-11-11 17:03:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397261921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:14,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:03:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194956537] [2024-11-11 17:03:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:14,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:14,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:14,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:14,465 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 17:03:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:18,230 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2024-11-11 17:03:18,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:18,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-11-11 17:03:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:18,264 INFO L225 Difference]: With dead ends: 17443 [2024-11-11 17:03:18,265 INFO L226 Difference]: Without dead ends: 10745 [2024-11-11 17:03:18,277 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 17:03:18,279 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:18,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 965 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-11 17:03:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2024-11-11 17:03:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2024-11-11 17:03:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 0 states have call successors, (0), 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 17:03:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2024-11-11 17:03:18,472 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 147 [2024-11-11 17:03:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:18,474 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2024-11-11 17:03:18,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 17:03:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2024-11-11 17:03:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 17:03:18,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:18,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:18,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:03:18,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:18,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2110509215, now seen corresponding path program 1 times [2024-11-11 17:03:18,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:18,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571922712] [2024-11-11 17:03:18,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:18,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571922712] [2024-11-11 17:03:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571922712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:18,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:18,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:03:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403157424] [2024-11-11 17:03:18,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:18,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:18,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:18,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:18,884 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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 17:03:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:21,566 INFO L93 Difference]: Finished difference Result 20549 states and 28119 transitions. [2024-11-11 17:03:21,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:21,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2024-11-11 17:03:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:21,596 INFO L225 Difference]: With dead ends: 20549 [2024-11-11 17:03:21,596 INFO L226 Difference]: Without dead ends: 10669 [2024-11-11 17:03:21,609 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 17:03:21,612 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:21,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1212 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 17:03:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10669 states. [2024-11-11 17:03:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10669 to 10669. [2024-11-11 17:03:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3539557555305586) internal successors, (14444), 10668 states have internal predecessors, (14444), 0 states have call successors, (0), 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 17:03:21,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14444 transitions. [2024-11-11 17:03:21,807 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14444 transitions. Word has length 157 [2024-11-11 17:03:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:21,807 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14444 transitions. [2024-11-11 17:03:21,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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 17:03:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14444 transitions. [2024-11-11 17:03:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-11 17:03:21,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:21,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:21,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:03:21,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:21,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:21,811 INFO L85 PathProgramCache]: Analyzing trace with hash -339079179, now seen corresponding path program 1 times [2024-11-11 17:03:21,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:21,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358942672] [2024-11-11 17:03:21,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:21,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:21,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:21,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358942672] [2024-11-11 17:03:21,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358942672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:21,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:21,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:21,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251808333] [2024-11-11 17:03:21,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:21,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:21,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:21,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:21,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:21,981 INFO L87 Difference]: Start difference. First operand 10669 states and 14444 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 17:03:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:25,471 INFO L93 Difference]: Finished difference Result 29991 states and 41155 transitions. [2024-11-11 17:03:25,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:25,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2024-11-11 17:03:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:25,520 INFO L225 Difference]: With dead ends: 29991 [2024-11-11 17:03:25,521 INFO L226 Difference]: Without dead ends: 20111 [2024-11-11 17:03:25,535 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 17:03:25,536 INFO L435 NwaCegarLoop]: 1849 mSDtfsCounter, 891 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:25,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 1988 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 17:03:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20111 states. [2024-11-11 17:03:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20111 to 19314. [2024-11-11 17:03:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19314 states, 19313 states have (on average 1.2808470978097655) internal successors, (24737), 19313 states have internal predecessors, (24737), 0 states have call successors, (0), 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 17:03:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19314 states to 19314 states and 24737 transitions. [2024-11-11 17:03:25,890 INFO L78 Accepts]: Start accepts. Automaton has 19314 states and 24737 transitions. Word has length 171 [2024-11-11 17:03:25,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:25,891 INFO L471 AbstractCegarLoop]: Abstraction has 19314 states and 24737 transitions. [2024-11-11 17:03:25,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 17:03:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 19314 states and 24737 transitions. [2024-11-11 17:03:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-11 17:03:25,898 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:25,898 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:03:25,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:03:25,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:25,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1894492209, now seen corresponding path program 1 times [2024-11-11 17:03:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:25,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793418727] [2024-11-11 17:03:25,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-11 17:03:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:26,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793418727] [2024-11-11 17:03:26,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793418727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:26,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:26,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:03:26,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212265329] [2024-11-11 17:03:26,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:26,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:26,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:26,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:26,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:26,356 INFO L87 Difference]: Start difference. First operand 19314 states and 24737 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 17:03:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:29,381 INFO L93 Difference]: Finished difference Result 44944 states and 56956 transitions. [2024-11-11 17:03:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:29,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 258 [2024-11-11 17:03:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:29,429 INFO L225 Difference]: With dead ends: 44944 [2024-11-11 17:03:29,429 INFO L226 Difference]: Without dead ends: 25632 [2024-11-11 17:03:29,450 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 17:03:29,451 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 728 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:29,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1192 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 17:03:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25632 states. [2024-11-11 17:03:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25632 to 25622. [2024-11-11 17:03:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25622 states, 25621 states have (on average 1.232621677530151) internal successors, (31581), 25621 states have internal predecessors, (31581), 0 states have call successors, (0), 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 17:03:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25622 states to 25622 states and 31581 transitions. [2024-11-11 17:03:29,763 INFO L78 Accepts]: Start accepts. Automaton has 25622 states and 31581 transitions. Word has length 258 [2024-11-11 17:03:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:29,763 INFO L471 AbstractCegarLoop]: Abstraction has 25622 states and 31581 transitions. [2024-11-11 17:03:29,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 17:03:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 25622 states and 31581 transitions. [2024-11-11 17:03:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-11 17:03:29,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:29,768 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:29,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:03:29,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:29,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash -561364737, now seen corresponding path program 1 times [2024-11-11 17:03:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:29,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790393550] [2024-11-11 17:03:29,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:29,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:29,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790393550] [2024-11-11 17:03:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790393550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:29,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:29,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:29,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846649616] [2024-11-11 17:03:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:29,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:29,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:29,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:29,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:29,984 INFO L87 Difference]: Start difference. First operand 25622 states and 31581 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 17:03:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:33,563 INFO L93 Difference]: Finished difference Result 72509 states and 89970 transitions. [2024-11-11 17:03:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2024-11-11 17:03:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:33,626 INFO L225 Difference]: With dead ends: 72509 [2024-11-11 17:03:33,626 INFO L226 Difference]: Without dead ends: 47676 [2024-11-11 17:03:33,656 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 17:03:33,657 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 827 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:33,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 898 Invalid, 3294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 17:03:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47676 states. [2024-11-11 17:03:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47676 to 46091. [2024-11-11 17:03:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46091 states, 46090 states have (on average 1.1851377739205902) internal successors, (54623), 46090 states have internal predecessors, (54623), 0 states have call successors, (0), 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 17:03:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46091 states to 46091 states and 54623 transitions. [2024-11-11 17:03:34,206 INFO L78 Accepts]: Start accepts. Automaton has 46091 states and 54623 transitions. Word has length 273 [2024-11-11 17:03:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:34,209 INFO L471 AbstractCegarLoop]: Abstraction has 46091 states and 54623 transitions. [2024-11-11 17:03:34,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 17:03:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 46091 states and 54623 transitions. [2024-11-11 17:03:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-11 17:03:34,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:34,217 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:03:34,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:03:34,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:34,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1177672583, now seen corresponding path program 1 times [2024-11-11 17:03:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:34,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812604892] [2024-11-11 17:03:34,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 90 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:35,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:35,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812604892] [2024-11-11 17:03:35,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812604892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:03:35,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512963568] [2024-11-11 17:03:35,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:35,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:35,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:03:35,140 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 17:03:35,141 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 17:03:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:35,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:03:35,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:03:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-11 17:03:35,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:03:35,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512963568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:35,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:03:35,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 17:03:35,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215352865] [2024-11-11 17:03:35,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:35,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:35,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:35,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:03:35,581 INFO L87 Difference]: Start difference. First operand 46091 states and 54623 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 17:03:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:38,634 INFO L93 Difference]: Finished difference Result 91391 states and 108451 transitions. [2024-11-11 17:03:38,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:38,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 287 [2024-11-11 17:03:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:38,705 INFO L225 Difference]: With dead ends: 91391 [2024-11-11 17:03:38,705 INFO L226 Difference]: Without dead ends: 46089 [2024-11-11 17:03:38,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:03:38,748 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1160 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:38,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1441 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 17:03:38,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46089 states. [2024-11-11 17:03:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46089 to 46088. [2024-11-11 17:03:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46088 states, 46087 states have (on average 1.150693254062968) internal successors, (53032), 46087 states have internal predecessors, (53032), 0 states have call successors, (0), 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 17:03:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46088 states to 46088 states and 53032 transitions. [2024-11-11 17:03:39,500 INFO L78 Accepts]: Start accepts. Automaton has 46088 states and 53032 transitions. Word has length 287 [2024-11-11 17:03:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:39,501 INFO L471 AbstractCegarLoop]: Abstraction has 46088 states and 53032 transitions. [2024-11-11 17:03:39,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 17:03:39,501 INFO L276 IsEmpty]: Start isEmpty. Operand 46088 states and 53032 transitions. [2024-11-11 17:03:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-11 17:03:39,508 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:39,509 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, 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] [2024-11-11 17:03:39,529 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 17:03:39,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:39,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1768426365, now seen corresponding path program 1 times [2024-11-11 17:03:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:39,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426167384] [2024-11-11 17:03:39,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 216 proven. 113 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-11 17:03:41,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:41,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426167384] [2024-11-11 17:03:41,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426167384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:03:41,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315819179] [2024-11-11 17:03:41,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:41,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:41,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:03:41,384 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 17:03:41,386 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 17:03:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:41,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:03:41,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:03:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-11 17:03:41,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:03:41,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315819179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:41,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:03:41,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-11 17:03:41,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385505945] [2024-11-11 17:03:41,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:41,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:41,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:41,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:41,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-11 17:03:41,659 INFO L87 Difference]: Start difference. First operand 46088 states and 53032 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 17:03:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:44,657 INFO L93 Difference]: Finished difference Result 91376 states and 105260 transitions. [2024-11-11 17:03:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:44,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 352 [2024-11-11 17:03:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:44,829 INFO L225 Difference]: With dead ends: 91376 [2024-11-11 17:03:44,830 INFO L226 Difference]: Without dead ends: 46077 [2024-11-11 17:03:44,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-11 17:03:44,858 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 1075 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:44,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 817 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 17:03:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46077 states. [2024-11-11 17:03:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46077 to 46074. [2024-11-11 17:03:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46074 states, 46073 states have (on average 1.1090443426735832) internal successors, (51097), 46073 states have internal predecessors, (51097), 0 states have call successors, (0), 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 17:03:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46074 states to 46074 states and 51097 transitions. [2024-11-11 17:03:45,279 INFO L78 Accepts]: Start accepts. Automaton has 46074 states and 51097 transitions. Word has length 352 [2024-11-11 17:03:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:45,279 INFO L471 AbstractCegarLoop]: Abstraction has 46074 states and 51097 transitions. [2024-11-11 17:03:45,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 17:03:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 46074 states and 51097 transitions. [2024-11-11 17:03:45,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2024-11-11 17:03:45,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:45,287 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:45,306 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 17:03:45,488 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,SelfDestructingSolverStorable9 [2024-11-11 17:03:45,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:45,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:45,489 INFO L85 PathProgramCache]: Analyzing trace with hash 143007617, now seen corresponding path program 1 times [2024-11-11 17:03:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:45,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864390507] [2024-11-11 17:03:45,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:45,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-11 17:03:45,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:45,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864390507] [2024-11-11 17:03:45,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864390507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:45,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:45,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792580238] [2024-11-11 17:03:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:45,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:03:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:03:45,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:03:45,879 INFO L87 Difference]: Start difference. First operand 46074 states and 51097 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 17:03:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:52,176 INFO L93 Difference]: Finished difference Result 122259 states and 136283 transitions. [2024-11-11 17:03:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:03:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 394 [2024-11-11 17:03:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:52,261 INFO L225 Difference]: With dead ends: 122259 [2024-11-11 17:03:52,261 INFO L226 Difference]: Without dead ends: 76974 [2024-11-11 17:03:52,279 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 17:03:52,279 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1700 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 6751 mSolverCounterSat, 1002 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 7753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1002 IncrementalHoareTripleChecker+Valid, 6751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:52,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 892 Invalid, 7753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1002 Valid, 6751 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-11 17:03:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76974 states. [2024-11-11 17:03:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76974 to 57894. [2024-11-11 17:03:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57894 states, 57893 states have (on average 1.1003575561812309) internal successors, (63703), 57893 states have internal predecessors, (63703), 0 states have call successors, (0), 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 17:03:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57894 states to 57894 states and 63703 transitions. [2024-11-11 17:03:53,194 INFO L78 Accepts]: Start accepts. Automaton has 57894 states and 63703 transitions. Word has length 394 [2024-11-11 17:03:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:53,194 INFO L471 AbstractCegarLoop]: Abstraction has 57894 states and 63703 transitions. [2024-11-11 17:03:53,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 17:03:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 57894 states and 63703 transitions. [2024-11-11 17:03:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-11 17:03:53,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:53,204 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:53,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:03:53,205 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:53,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1259811683, now seen corresponding path program 1 times [2024-11-11 17:03:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:53,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662566649] [2024-11-11 17:03:53,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-11 17:03:53,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:53,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662566649] [2024-11-11 17:03:53,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662566649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:53,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:53,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:53,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249401410] [2024-11-11 17:03:53,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:53,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:53,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:53,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:53,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:53,680 INFO L87 Difference]: Start difference. First operand 57894 states and 63703 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 17:03:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:57,360 INFO L93 Difference]: Finished difference Result 139407 states and 154440 transitions. [2024-11-11 17:03:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:57,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 407 [2024-11-11 17:03:57,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:57,462 INFO L225 Difference]: With dead ends: 139407 [2024-11-11 17:03:57,462 INFO L226 Difference]: Without dead ends: 82302 [2024-11-11 17:03:57,495 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 17:03:57,495 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 831 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 963 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 3369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 963 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:57,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 833 Invalid, 3369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [963 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 17:03:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82302 states. [2024-11-11 17:03:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82302 to 80710. [2024-11-11 17:03:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80710 states, 80709 states have (on average 1.1005959682315478) internal successors, (88828), 80709 states have internal predecessors, (88828), 0 states have call successors, (0), 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 17:03:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80710 states to 80710 states and 88828 transitions. [2024-11-11 17:03:58,799 INFO L78 Accepts]: Start accepts. Automaton has 80710 states and 88828 transitions. Word has length 407 [2024-11-11 17:03:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:58,800 INFO L471 AbstractCegarLoop]: Abstraction has 80710 states and 88828 transitions. [2024-11-11 17:03:58,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 17:03:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 80710 states and 88828 transitions. [2024-11-11 17:03:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-11 17:03:58,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:58,815 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:03:58,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:03:58,815 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:58,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1404182117, now seen corresponding path program 1 times [2024-11-11 17:03:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:58,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167757886] [2024-11-11 17:03:58,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:58,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-11 17:03:59,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:59,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167757886] [2024-11-11 17:03:59,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167757886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:59,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:59,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:59,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731163504] [2024-11-11 17:03:59,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:59,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:59,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:59,372 INFO L87 Difference]: Start difference. First operand 80710 states and 88828 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:02,770 INFO L93 Difference]: Finished difference Result 182696 states and 200598 transitions. [2024-11-11 17:04:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:02,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427 [2024-11-11 17:04:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:02,903 INFO L225 Difference]: With dead ends: 182696 [2024-11-11 17:04:02,903 INFO L226 Difference]: Without dead ends: 102775 [2024-11-11 17:04:02,941 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 17:04:02,942 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 804 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:02,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1114 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 17:04:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102775 states. [2024-11-11 17:04:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102775 to 98815. [2024-11-11 17:04:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98815 states, 98814 states have (on average 1.0907260104843444) internal successors, (107779), 98814 states have internal predecessors, (107779), 0 states have call successors, (0), 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 17:04:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98815 states to 98815 states and 107779 transitions. [2024-11-11 17:04:04,160 INFO L78 Accepts]: Start accepts. Automaton has 98815 states and 107779 transitions. Word has length 427 [2024-11-11 17:04:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:04,161 INFO L471 AbstractCegarLoop]: Abstraction has 98815 states and 107779 transitions. [2024-11-11 17:04:04,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 98815 states and 107779 transitions. [2024-11-11 17:04:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-11 17:04:04,168 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:04,169 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:04,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 17:04:04,169 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:04,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash -625667605, now seen corresponding path program 1 times [2024-11-11 17:04:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:04,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892544299] [2024-11-11 17:04:04,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:04,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat