./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.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 e8feab662bc73c18f88b757dfbe2687c764aa0043a35ed648ed6332a38c0448d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:37:53,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:37:53,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:37:53,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:37:53,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:37:53,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:37:53,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:37:53,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:37:53,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:37:53,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:37:53,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:37:53,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:37:53,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:37:53,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:37:53,142 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:37:53,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:37:53,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:37:53,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:37:53,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:37:53,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:37:53,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:37:53,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:37:53,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:37:53,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:37:53,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:37:53,148 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:37:53,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:37:53,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:37:53,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:37:53,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:37:53,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:37:53,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:37:53,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:37:53,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:37:53,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:37:53,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:37:53,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:37:53,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:37:53,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:37:53,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:37:53,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:37:53,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:37:53,153 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 -> e8feab662bc73c18f88b757dfbe2687c764aa0043a35ed648ed6332a38c0448d [2024-10-13 23:37:53,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:37:53,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:37:53,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:37:53,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:37:53,423 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:37:53,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.c [2024-10-13 23:37:54,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:37:55,409 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:37:55,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.c [2024-10-13 23:37:55,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d56ead4/289b47a0f4944d009fdb54b423630e0f/FLAG4ea512f76 [2024-10-13 23:37:55,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d56ead4/289b47a0f4944d009fdb54b423630e0f [2024-10-13 23:37:55,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:37:55,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:37:55,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:37:55,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:37:55,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:37:55,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:37:55" (1/1) ... [2024-10-13 23:37:55,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751002e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:55, skipping insertion in model container [2024-10-13 23:37:55,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:37:55" (1/1) ... [2024-10-13 23:37:56,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:37:56,281 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.c[6468,6481] [2024-10-13 23:37:57,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:37:57,133 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:37:57,156 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.c[6468,6481] [2024-10-13 23:37:57,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:37:57,679 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:37:57,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57 WrapperNode [2024-10-13 23:37:57,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:37:57,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:37:57,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:37:57,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:37:57,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:57,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:58,255 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-13 23:37:58,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:37:58,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:37:58,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:37:58,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:37:58,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:58,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:58,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:58,832 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:37:58,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:58,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:59,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:59,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:59,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:59,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:59,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:37:59,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:37:59,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:37:59,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:37:59,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (1/1) ... [2024-10-13 23:37:59,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:37:59,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:37:59,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:37:59,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:37:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:37:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:37:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:37:59,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:37:59,489 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:37:59,490 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:38:04,997 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-13 23:38:04,997 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:38:05,071 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:38:05,072 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:38:05,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:38:05 BoogieIcfgContainer [2024-10-13 23:38:05,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:38:05,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:38:05,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:38:05,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:38:05,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:37:55" (1/3) ... [2024-10-13 23:38:05,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655f2214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:38:05, skipping insertion in model container [2024-10-13 23:38:05,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:37:57" (2/3) ... [2024-10-13 23:38:05,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655f2214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:38:05, skipping insertion in model container [2024-10-13 23:38:05,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:38:05" (3/3) ... [2024-10-13 23:38:05,082 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label27.c [2024-10-13 23:38:05,099 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:38:05,099 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:38:05,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:38:05,211 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;@a461c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:38:05,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:38:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 23:38:05,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:05,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:05,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:05,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1017894885, now seen corresponding path program 1 times [2024-10-13 23:38:05,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:05,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681093303] [2024-10-13 23:38:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:05,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681093303] [2024-10-13 23:38:05,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681093303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:05,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:05,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:05,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818256560] [2024-10-13 23:38:05,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:05,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:38:05,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:38:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:38:05,458 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:05,550 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-13 23:38:05,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:38:05,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-13 23:38:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:05,585 INFO L225 Difference]: With dead ends: 2071 [2024-10-13 23:38:05,586 INFO L226 Difference]: Without dead ends: 1034 [2024-10-13 23:38:05,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:38:05,596 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:05,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:38:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-13 23:38:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-13 23:38:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-13 23:38:05,714 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 44 [2024-10-13 23:38:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:05,715 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-13 23:38:05,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-13 23:38:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 23:38:05,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:05,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:05,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:38:05,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:05,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:05,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1786485728, now seen corresponding path program 1 times [2024-10-13 23:38:05,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:05,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238724851] [2024-10-13 23:38:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:05,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:05,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:05,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238724851] [2024-10-13 23:38:05,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238724851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:05,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:05,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:05,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083859729] [2024-10-13 23:38:05,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:05,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:05,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:05,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:05,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:05,946 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:10,498 INFO L93 Difference]: Finished difference Result 3015 states and 5510 transitions. [2024-10-13 23:38:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:10,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-13 23:38:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:10,508 INFO L225 Difference]: With dead ends: 3015 [2024-10-13 23:38:10,509 INFO L226 Difference]: Without dead ends: 1982 [2024-10-13 23:38:10,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:10,512 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 1010 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 3885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 929 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:10,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 317 Invalid, 3885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [929 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 23:38:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2024-10-13 23:38:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1929. [2024-10-13 23:38:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1928 states have (on average 1.7977178423236515) internal successors, (3466), 1928 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3466 transitions. [2024-10-13 23:38:10,567 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3466 transitions. Word has length 44 [2024-10-13 23:38:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:10,568 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 3466 transitions. [2024-10-13 23:38:10,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3466 transitions. [2024-10-13 23:38:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 23:38:10,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:10,575 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:10,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:38:10,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:10,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2110678795, now seen corresponding path program 1 times [2024-10-13 23:38:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:10,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280744753] [2024-10-13 23:38:10,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:10,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:10,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:10,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280744753] [2024-10-13 23:38:10,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280744753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:10,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:10,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:10,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521340933] [2024-10-13 23:38:10,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:10,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:10,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:10,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:10,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:10,843 INFO L87 Difference]: Start difference. First operand 1929 states and 3466 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:14,455 INFO L93 Difference]: Finished difference Result 5455 states and 9916 transitions. [2024-10-13 23:38:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-10-13 23:38:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:14,469 INFO L225 Difference]: With dead ends: 5455 [2024-10-13 23:38:14,469 INFO L226 Difference]: Without dead ends: 3527 [2024-10-13 23:38:14,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:14,473 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:14,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1005 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 23:38:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2024-10-13 23:38:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3525. [2024-10-13 23:38:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 3524 states have (on average 1.5672531214528944) internal successors, (5523), 3524 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 5523 transitions. [2024-10-13 23:38:14,533 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 5523 transitions. Word has length 109 [2024-10-13 23:38:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:14,534 INFO L471 AbstractCegarLoop]: Abstraction has 3525 states and 5523 transitions. [2024-10-13 23:38:14,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 5523 transitions. [2024-10-13 23:38:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 23:38:14,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:14,536 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:14,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:38:14,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:14,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1023593318, now seen corresponding path program 1 times [2024-10-13 23:38:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:14,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401191062] [2024-10-13 23:38:14,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:14,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401191062] [2024-10-13 23:38:14,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401191062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:14,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:14,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994360781] [2024-10-13 23:38:14,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:14,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:14,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:14,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:14,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:14,718 INFO L87 Difference]: Start difference. First operand 3525 states and 5523 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:17,918 INFO L93 Difference]: Finished difference Result 10231 states and 16096 transitions. [2024-10-13 23:38:17,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:17,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-13 23:38:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:17,945 INFO L225 Difference]: With dead ends: 10231 [2024-10-13 23:38:17,945 INFO L226 Difference]: Without dead ends: 6707 [2024-10-13 23:38:17,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:17,958 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 972 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:17,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 848 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:38:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6707 states. [2024-10-13 23:38:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6707 to 6699. [2024-10-13 23:38:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6699 states, 6698 states have (on average 1.4131083905643476) internal successors, (9465), 6698 states have internal predecessors, (9465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6699 states to 6699 states and 9465 transitions. [2024-10-13 23:38:18,102 INFO L78 Accepts]: Start accepts. Automaton has 6699 states and 9465 transitions. Word has length 115 [2024-10-13 23:38:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:18,103 INFO L471 AbstractCegarLoop]: Abstraction has 6699 states and 9465 transitions. [2024-10-13 23:38:18,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 6699 states and 9465 transitions. [2024-10-13 23:38:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 23:38:18,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:18,110 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:18,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:38:18,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:18,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1522333595, now seen corresponding path program 1 times [2024-10-13 23:38:18,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:18,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482744993] [2024-10-13 23:38:18,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:18,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482744993] [2024-10-13 23:38:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482744993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723119840] [2024-10-13 23:38:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:18,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:18,319 INFO L87 Difference]: Start difference. First operand 6699 states and 9465 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:22,039 INFO L93 Difference]: Finished difference Result 17442 states and 24478 transitions. [2024-10-13 23:38:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:22,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-13 23:38:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:22,066 INFO L225 Difference]: With dead ends: 17442 [2024-10-13 23:38:22,066 INFO L226 Difference]: Without dead ends: 10744 [2024-10-13 23:38:22,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:22,079 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3292 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:22,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 963 Invalid, 3742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3292 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 23:38:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10744 states. [2024-10-13 23:38:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10744 to 10668. [2024-10-13 23:38:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10668 states, 10667 states have (on average 1.3563326146057935) internal successors, (14468), 10667 states have internal predecessors, (14468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10668 states to 10668 states and 14468 transitions. [2024-10-13 23:38:22,296 INFO L78 Accepts]: Start accepts. Automaton has 10668 states and 14468 transitions. Word has length 145 [2024-10-13 23:38:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:22,297 INFO L471 AbstractCegarLoop]: Abstraction has 10668 states and 14468 transitions. [2024-10-13 23:38:22,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 10668 states and 14468 transitions. [2024-10-13 23:38:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 23:38:22,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:22,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:22,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:38:22,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:22,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -249489538, now seen corresponding path program 1 times [2024-10-13 23:38:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:22,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094933659] [2024-10-13 23:38:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:22,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:22,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094933659] [2024-10-13 23:38:22,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094933659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:22,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:22,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:22,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143097019] [2024-10-13 23:38:22,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:22,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:22,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:22,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:22,663 INFO L87 Difference]: Start difference. First operand 10668 states and 14468 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:25,215 INFO L93 Difference]: Finished difference Result 20548 states and 28118 transitions. [2024-10-13 23:38:25,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:25,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-10-13 23:38:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:25,237 INFO L225 Difference]: With dead ends: 20548 [2024-10-13 23:38:25,238 INFO L226 Difference]: Without dead ends: 10668 [2024-10-13 23:38:25,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:25,249 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:25,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1210 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:38:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2024-10-13 23:38:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 10668. [2024-10-13 23:38:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10668 states, 10667 states have (on average 1.3539889378456924) internal successors, (14443), 10667 states have internal predecessors, (14443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10668 states to 10668 states and 14443 transitions. [2024-10-13 23:38:25,398 INFO L78 Accepts]: Start accepts. Automaton has 10668 states and 14443 transitions. Word has length 155 [2024-10-13 23:38:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:25,398 INFO L471 AbstractCegarLoop]: Abstraction has 10668 states and 14443 transitions. [2024-10-13 23:38:25,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 10668 states and 14443 transitions. [2024-10-13 23:38:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-13 23:38:25,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:25,401 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:25,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:38:25,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:25,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1836590104, now seen corresponding path program 1 times [2024-10-13 23:38:25,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:25,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005004686] [2024-10-13 23:38:25,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:25,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:25,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005004686] [2024-10-13 23:38:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005004686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:25,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027653694] [2024-10-13 23:38:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:25,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:25,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:25,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:25,550 INFO L87 Difference]: Start difference. First operand 10668 states and 14443 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:28,578 INFO L93 Difference]: Finished difference Result 29990 states and 41154 transitions. [2024-10-13 23:38:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:28,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2024-10-13 23:38:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:28,615 INFO L225 Difference]: With dead ends: 29990 [2024-10-13 23:38:28,615 INFO L226 Difference]: Without dead ends: 20110 [2024-10-13 23:38:28,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:28,629 INFO L432 NwaCegarLoop]: 1847 mSDtfsCounter, 892 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:28,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1985 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:38:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20110 states. [2024-10-13 23:38:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20110 to 19313. [2024-10-13 23:38:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19313 states, 19312 states have (on average 1.2808616404308202) internal successors, (24736), 19312 states have internal predecessors, (24736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19313 states to 19313 states and 24736 transitions. [2024-10-13 23:38:28,873 INFO L78 Accepts]: Start accepts. Automaton has 19313 states and 24736 transitions. Word has length 169 [2024-10-13 23:38:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:28,874 INFO L471 AbstractCegarLoop]: Abstraction has 19313 states and 24736 transitions. [2024-10-13 23:38:28,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 19313 states and 24736 transitions. [2024-10-13 23:38:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-13 23:38:28,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:28,879 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:28,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:38:28,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:28,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash -23937511, now seen corresponding path program 1 times [2024-10-13 23:38:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:28,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766409754] [2024-10-13 23:38:28,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-13 23:38:29,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:29,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766409754] [2024-10-13 23:38:29,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766409754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:29,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:29,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380294090] [2024-10-13 23:38:29,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:29,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:29,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:29,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:29,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:29,275 INFO L87 Difference]: Start difference. First operand 19313 states and 24736 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:32,379 INFO L93 Difference]: Finished difference Result 44941 states and 56954 transitions. [2024-10-13 23:38:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:32,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 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 256 [2024-10-13 23:38:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:32,445 INFO L225 Difference]: With dead ends: 44941 [2024-10-13 23:38:32,445 INFO L226 Difference]: Without dead ends: 25629 [2024-10-13 23:38:32,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:32,470 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 726 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:32,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1189 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:38:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25629 states. [2024-10-13 23:38:32,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25629 to 25621. [2024-10-13 23:38:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25621 states, 25620 states have (on average 1.2324746291959408) internal successors, (31576), 25620 states have internal predecessors, (31576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25621 states to 25621 states and 31576 transitions. [2024-10-13 23:38:32,804 INFO L78 Accepts]: Start accepts. Automaton has 25621 states and 31576 transitions. Word has length 256 [2024-10-13 23:38:32,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:32,805 INFO L471 AbstractCegarLoop]: Abstraction has 25621 states and 31576 transitions. [2024-10-13 23:38:32,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand 25621 states and 31576 transitions. [2024-10-13 23:38:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-13 23:38:32,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:32,809 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:38:32,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:38:32,809 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:32,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:32,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1248951905, now seen corresponding path program 1 times [2024-10-13 23:38:32,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:32,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704111032] [2024-10-13 23:38:32,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:32,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:33,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:33,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704111032] [2024-10-13 23:38:33,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704111032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:33,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:33,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:33,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669890866] [2024-10-13 23:38:33,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:33,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:33,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:33,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:33,019 INFO L87 Difference]: Start difference. First operand 25621 states and 31576 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:36,347 INFO L93 Difference]: Finished difference Result 72508 states and 89960 transitions. [2024-10-13 23:38:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:36,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2024-10-13 23:38:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:36,399 INFO L225 Difference]: With dead ends: 72508 [2024-10-13 23:38:36,400 INFO L226 Difference]: Without dead ends: 47675 [2024-10-13 23:38:36,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:36,419 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 824 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:36,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 898 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:38:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47675 states. [2024-10-13 23:38:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47675 to 46090. [2024-10-13 23:38:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46090 states, 46089 states have (on average 1.1848597279177244) internal successors, (54609), 46089 states have internal predecessors, (54609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46090 states to 46090 states and 54609 transitions. [2024-10-13 23:38:36,905 INFO L78 Accepts]: Start accepts. Automaton has 46090 states and 54609 transitions. Word has length 271 [2024-10-13 23:38:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:36,907 INFO L471 AbstractCegarLoop]: Abstraction has 46090 states and 54609 transitions. [2024-10-13 23:38:36,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 46090 states and 54609 transitions. [2024-10-13 23:38:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-13 23:38:36,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:36,920 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:36,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:38:36,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:36,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:36,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1901814472, now seen corresponding path program 1 times [2024-10-13 23:38:36,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:36,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257778039] [2024-10-13 23:38:36,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 217 proven. 110 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-13 23:38:38,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:38,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257778039] [2024-10-13 23:38:38,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257778039] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:38:38,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751302762] [2024-10-13 23:38:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:38,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:38:38,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:38:38,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:38:38,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:38:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:38,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:38:38,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:38:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-13 23:38:38,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:38:38,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751302762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:38,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:38:38,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-13 23:38:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119539] [2024-10-13 23:38:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:38,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:38,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:38,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:38,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:38:38,450 INFO L87 Difference]: Start difference. First operand 46090 states and 54609 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:41,557 INFO L93 Difference]: Finished difference Result 91381 states and 108415 transitions. [2024-10-13 23:38:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 350 [2024-10-13 23:38:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:41,620 INFO L225 Difference]: With dead ends: 91381 [2024-10-13 23:38:41,620 INFO L226 Difference]: Without dead ends: 46079 [2024-10-13 23:38:41,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 349 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-10-13 23:38:41,658 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 1076 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:41,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 820 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 23:38:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46079 states. [2024-10-13 23:38:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46079 to 46076. [2024-10-13 23:38:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46076 states, 46075 states have (on average 1.1360607704829082) internal successors, (52344), 46075 states have internal predecessors, (52344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46076 states to 46076 states and 52344 transitions. [2024-10-13 23:38:42,191 INFO L78 Accepts]: Start accepts. Automaton has 46076 states and 52344 transitions. Word has length 350 [2024-10-13 23:38:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:42,192 INFO L471 AbstractCegarLoop]: Abstraction has 46076 states and 52344 transitions. [2024-10-13 23:38:42,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 46076 states and 52344 transitions. [2024-10-13 23:38:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-13 23:38:42,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:42,198 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:38:42,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 23:38:42,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 23:38:42,400 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:42,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:42,401 INFO L85 PathProgramCache]: Analyzing trace with hash -604995767, now seen corresponding path program 1 times [2024-10-13 23:38:42,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:42,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885446731] [2024-10-13 23:38:42,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:42,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 23:38:42,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:42,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885446731] [2024-10-13 23:38:42,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885446731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:42,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:42,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:42,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25115570] [2024-10-13 23:38:42,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:42,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:42,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:42,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:42,808 INFO L87 Difference]: Start difference. First operand 46076 states and 52344 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:45,895 INFO L93 Difference]: Finished difference Result 101585 states and 116819 transitions. [2024-10-13 23:38:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2024-10-13 23:38:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:45,957 INFO L225 Difference]: With dead ends: 101585 [2024-10-13 23:38:45,957 INFO L226 Difference]: Without dead ends: 56297 [2024-10-13 23:38:45,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:45,994 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 1110 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:45,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1522 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:38:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56297 states. [2024-10-13 23:38:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56297 to 56296. [2024-10-13 23:38:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56296 states, 56295 states have (on average 1.1241673328004262) internal successors, (63285), 56295 states have internal predecessors, (63285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56296 states to 56296 states and 63285 transitions. [2024-10-13 23:38:46,814 INFO L78 Accepts]: Start accepts. Automaton has 56296 states and 63285 transitions. Word has length 359 [2024-10-13 23:38:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:46,814 INFO L471 AbstractCegarLoop]: Abstraction has 56296 states and 63285 transitions. [2024-10-13 23:38:46,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 56296 states and 63285 transitions. [2024-10-13 23:38:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-10-13 23:38:46,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:46,824 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:46,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:38:46,824 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:46,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1227654167, now seen corresponding path program 1 times [2024-10-13 23:38:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:46,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201219080] [2024-10-13 23:38:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:46,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-13 23:38:47,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:47,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201219080] [2024-10-13 23:38:47,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201219080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:47,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:47,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:47,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198781593] [2024-10-13 23:38:47,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:47,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:38:47,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:47,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:38:47,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:38:47,207 INFO L87 Difference]: Start difference. First operand 56296 states and 63285 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:53,491 INFO L93 Difference]: Finished difference Result 141881 states and 159542 transitions. [2024-10-13 23:38:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:38:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 392 [2024-10-13 23:38:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:53,613 INFO L225 Difference]: With dead ends: 141881 [2024-10-13 23:38:53,613 INFO L226 Difference]: Without dead ends: 86373 [2024-10-13 23:38:53,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:38:53,633 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 1677 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 6623 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 7552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 929 IncrementalHoareTripleChecker+Valid, 6623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:53,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 916 Invalid, 7552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [929 Valid, 6623 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-13 23:38:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86373 states. [2024-10-13 23:38:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86373 to 68113. [2024-10-13 23:38:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68113 states, 68112 states have (on average 1.1126086445853887) internal successors, (75782), 68112 states have internal predecessors, (75782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68113 states to 68113 states and 75782 transitions. [2024-10-13 23:38:54,726 INFO L78 Accepts]: Start accepts. Automaton has 68113 states and 75782 transitions. Word has length 392 [2024-10-13 23:38:54,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:54,726 INFO L471 AbstractCegarLoop]: Abstraction has 68113 states and 75782 transitions. [2024-10-13 23:38:54,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 68113 states and 75782 transitions. [2024-10-13 23:38:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-10-13 23:38:54,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:54,735 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:38:54,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:38:54,735 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:54,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2106809376, now seen corresponding path program 1 times [2024-10-13 23:38:54,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:54,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318016609] [2024-10-13 23:38:54,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:54,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-13 23:38:55,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318016609] [2024-10-13 23:38:55,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318016609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:55,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:55,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213642553] [2024-10-13 23:38:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:55,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:55,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:55,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:55,225 INFO L87 Difference]: Start difference. First operand 68113 states and 75782 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:58,728 INFO L93 Difference]: Finished difference Result 159832 states and 178093 transitions. [2024-10-13 23:38:58,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:58,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 405 [2024-10-13 23:38:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:58,830 INFO L225 Difference]: With dead ends: 159832 [2024-10-13 23:38:58,830 INFO L226 Difference]: Without dead ends: 92507 [2024-10-13 23:38:58,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:58,862 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 830 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 936 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:58,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 781 Invalid, 3332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [936 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:38:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92507 states. [2024-10-13 23:38:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92507 to 90919. [2024-10-13 23:39:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90919 states, 90918 states have (on average 1.098715325898062) internal successors, (99893), 90918 states have internal predecessors, (99893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90919 states to 90919 states and 99893 transitions. [2024-10-13 23:39:00,134 INFO L78 Accepts]: Start accepts. Automaton has 90919 states and 99893 transitions. Word has length 405 [2024-10-13 23:39:00,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:00,134 INFO L471 AbstractCegarLoop]: Abstraction has 90919 states and 99893 transitions. [2024-10-13 23:39:00,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 90919 states and 99893 transitions. [2024-10-13 23:39:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-10-13 23:39:00,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:00,142 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:00,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:39:00,142 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:00,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1538354151, now seen corresponding path program 1 times [2024-10-13 23:39:00,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:00,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106767342] [2024-10-13 23:39:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:39:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106767342] [2024-10-13 23:39:00,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106767342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:00,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:00,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:00,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453287388] [2024-10-13 23:39:00,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:00,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:00,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:00,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:00,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:00,798 INFO L87 Difference]: Start difference. First operand 90919 states and 99893 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:03,988 INFO L93 Difference]: Finished difference Result 204686 states and 224263 transitions. [2024-10-13 23:39:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:03,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 425 [2024-10-13 23:39:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:04,120 INFO L225 Difference]: With dead ends: 204686 [2024-10-13 23:39:04,120 INFO L226 Difference]: Without dead ends: 114555 [2024-10-13 23:39:04,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:04,157 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 795 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:04,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1114 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:39:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114555 states. [2024-10-13 23:39:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114555 to 110598. [2024-10-13 23:39:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110598 states, 110597 states have (on average 1.0885105382605316) internal successors, (120386), 110597 states have internal predecessors, (120386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110598 states to 110598 states and 120386 transitions. [2024-10-13 23:39:05,649 INFO L78 Accepts]: Start accepts. Automaton has 110598 states and 120386 transitions. Word has length 425 [2024-10-13 23:39:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:05,650 INFO L471 AbstractCegarLoop]: Abstraction has 110598 states and 120386 transitions. [2024-10-13 23:39:05,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 110598 states and 120386 transitions. [2024-10-13 23:39:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2024-10-13 23:39:05,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:05,656 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:05,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:39:05,656 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:05,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:05,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1306435249, now seen corresponding path program 1 times [2024-10-13 23:39:05,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:05,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986211057] [2024-10-13 23:39:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:05,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 383 proven. 113 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-13 23:39:07,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:07,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986211057] [2024-10-13 23:39:07,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986211057] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:39:07,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026675509] [2024-10-13 23:39:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:07,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:39:07,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:39:07,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:39:07,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:39:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:07,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:39:07,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:39:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 23:39:08,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:39:08,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026675509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:08,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:39:08,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-10-13 23:39:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143558229] [2024-10-13 23:39:08,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:08,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:08,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:08,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:39:08,241 INFO L87 Difference]: Start difference. First operand 110598 states and 120386 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)