./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/Problem12_label35.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/Problem12_label35.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 d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:32:41,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:32:41,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:32:41,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:32:41,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:32:41,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:32:41,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:32:41,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:32:41,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:32:41,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:32:41,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:32:41,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:32:41,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:32:41,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:32:41,680 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:32:41,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:32:41,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:32:41,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:32:41,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:32:41,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:32:41,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:32:41,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:32:41,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:32:41,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:32:41,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:32:41,684 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:32:41,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:32:41,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:32:41,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:32:41,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:32:41,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:32:41,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:32:41,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:32:41,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:32:41,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:32:41,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:32:41,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:32:41,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:32:41,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:32:41,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:32:41,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:32:41,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:32:41,690 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 -> d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d [2024-10-13 23:32:41,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:32:41,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:32:41,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:32:41,992 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:32:41,993 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:32:41,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2024-10-13 23:32:43,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:32:43,905 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:32:43,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2024-10-13 23:32:43,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d346a53a/87168c4716ed4b2da134f8899bb6ba04/FLAGd67ea1053 [2024-10-13 23:32:43,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d346a53a/87168c4716ed4b2da134f8899bb6ba04 [2024-10-13 23:32:43,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:32:43,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:32:43,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:32:43,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:32:43,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:32:43,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:32:43" (1/1) ... [2024-10-13 23:32:43,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50714898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:43, skipping insertion in model container [2024-10-13 23:32:43,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:32:43" (1/1) ... [2024-10-13 23:32:44,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:32:44,347 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/Problem12_label35.c[1310,1323] [2024-10-13 23:32:45,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:32:45,126 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:32:45,139 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/Problem12_label35.c[1310,1323] [2024-10-13 23:32:45,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:32:45,653 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:32:45,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45 WrapperNode [2024-10-13 23:32:45,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:32:45,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:32:45,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:32:45,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:32:45,664 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:32:45" (1/1) ... [2024-10-13 23:32:45,724 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:32:45" (1/1) ... [2024-10-13 23:32:46,056 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-13 23:32:46,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:32:46,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:32:46,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:32:46,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:32:46,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (1/1) ... [2024-10-13 23:32:46,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (1/1) ... [2024-10-13 23:32:46,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (1/1) ... [2024-10-13 23:32:46,455 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:32:46,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (1/1) ... [2024-10-13 23:32:46,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (1/1) ... [2024-10-13 23:32:46,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (1/1) ... [2024-10-13 23:32:46,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (1/1) ... [2024-10-13 23:32:46,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (1/1) ... [2024-10-13 23:32:46,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (1/1) ... [2024-10-13 23:32:46,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:32:46,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:32:46,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:32:46,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:32:46,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (1/1) ... [2024-10-13 23:32:46,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:32:46,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:32:46,720 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:32:46,726 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:32:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:32:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:32:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:32:46,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:32:46,843 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:32:46,847 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:32:51,118 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-13 23:32:51,118 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:32:51,196 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:32:51,196 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:32:51,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:32:51 BoogieIcfgContainer [2024-10-13 23:32:51,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:32:51,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:32:51,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:32:51,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:32:51,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:32:43" (1/3) ... [2024-10-13 23:32:51,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1271d848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:32:51, skipping insertion in model container [2024-10-13 23:32:51,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:45" (2/3) ... [2024-10-13 23:32:51,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1271d848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:32:51, skipping insertion in model container [2024-10-13 23:32:51,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:32:51" (3/3) ... [2024-10-13 23:32:51,209 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label35.c [2024-10-13 23:32:51,227 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:32:51,227 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:32:51,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:32:51,335 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;@44ea2be1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:32:51,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:32:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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:32:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 23:32:51,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:51,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 23:32:51,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:51,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:51,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2003002367, now seen corresponding path program 1 times [2024-10-13 23:32:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:51,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648433192] [2024-10-13 23:32:51,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:51,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:51,529 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:32:51,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:51,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648433192] [2024-10-13 23:32:51,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648433192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:51,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:51,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:32:51,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046132486] [2024-10-13 23:32:51,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:51,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:32:51,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:51,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:32:51,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:32:51,569 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:32:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:32:51,678 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-13 23:32:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:32:51,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-13 23:32:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:32:51,705 INFO L225 Difference]: With dead ends: 1511 [2024-10-13 23:32:51,706 INFO L226 Difference]: Without dead ends: 754 [2024-10-13 23:32:51,713 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:32:51,717 INFO L432 NwaCegarLoop]: 1438 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, 1438 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:32:51,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:32:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-13 23:32:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-13 23:32:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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:32:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-13 23:32:51,790 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 6 [2024-10-13 23:32:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:32:51,790 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-13 23:32:51,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:32:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-13 23:32:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 23:32:51,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:51,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 23:32:51,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:32:51,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:51,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:51,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1999238130, now seen corresponding path program 1 times [2024-10-13 23:32:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550069085] [2024-10-13 23:32:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:51,886 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:32:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:51,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550069085] [2024-10-13 23:32:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550069085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:51,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:51,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:32:51,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369626170] [2024-10-13 23:32:51,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:51,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:32:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:51,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:32:51,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:32:51,893 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:32:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:32:55,161 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-13 23:32:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:32:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-13 23:32:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:32:55,168 INFO L225 Difference]: With dead ends: 2258 [2024-10-13 23:32:55,168 INFO L226 Difference]: Without dead ends: 1505 [2024-10-13 23:32:55,170 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:32:55,171 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 811 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:32:55,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 426 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 23:32:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-13 23:32:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-13 23:32:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 0 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:32:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2024-10-13 23:32:55,214 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 6 [2024-10-13 23:32:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:32:55,215 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2024-10-13 23:32:55,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:32:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2024-10-13 23:32:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 23:32:55,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:55,218 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:32:55,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:32:55,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:55,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2065069026, now seen corresponding path program 1 times [2024-10-13 23:32:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:55,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274652413] [2024-10-13 23:32:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:32:55,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:55,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274652413] [2024-10-13 23:32:55,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274652413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:55,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:55,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:32:55,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839583594] [2024-10-13 23:32:55,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:55,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:32:55,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:55,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:32:55,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:32:55,516 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:32:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:32:58,965 INFO L93 Difference]: Finished difference Result 4511 states and 7392 transitions. [2024-10-13 23:32:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:32:58,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-13 23:32:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:32:58,977 INFO L225 Difference]: With dead ends: 4511 [2024-10-13 23:32:58,977 INFO L226 Difference]: Without dead ends: 3007 [2024-10-13 23:32:58,980 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:32:58,982 INFO L432 NwaCegarLoop]: 1381 mSDtfsCounter, 772 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:32:58,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1388 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 23:32:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-13 23:32:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2024-10-13 23:32:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.363606121091151) internal successors, (4099), 3006 states have internal predecessors, (4099), 0 states have call successors, (0), 0 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:32:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4099 transitions. [2024-10-13 23:32:59,046 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4099 transitions. Word has length 77 [2024-10-13 23:32:59,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:32:59,048 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4099 transitions. [2024-10-13 23:32:59,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:32:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4099 transitions. [2024-10-13 23:32:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-13 23:32:59,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:59,056 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:32:59,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:32:59,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:59,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:59,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1174832142, now seen corresponding path program 1 times [2024-10-13 23:32:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:59,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313681606] [2024-10-13 23:32:59,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:59,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:32:59,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:59,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313681606] [2024-10-13 23:32:59,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313681606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:59,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:59,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:32:59,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393172423] [2024-10-13 23:32:59,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:59,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:32:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:32:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:32:59,193 INFO L87 Difference]: Start difference. First operand 3007 states and 4099 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:33:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:01,835 INFO L93 Difference]: Finished difference Result 7515 states and 10660 transitions. [2024-10-13 23:33:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:01,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-13 23:33:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:01,852 INFO L225 Difference]: With dead ends: 7515 [2024-10-13 23:33:01,852 INFO L226 Difference]: Without dead ends: 4509 [2024-10-13 23:33:01,856 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:33:01,858 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 748 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:01,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 518 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:33:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2024-10-13 23:33:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 4509. [2024-10-13 23:33:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4509 states, 4508 states have (on average 1.3251996450754215) internal successors, (5974), 4508 states have internal predecessors, (5974), 0 states have call successors, (0), 0 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:33:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 5974 transitions. [2024-10-13 23:33:01,951 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 5974 transitions. Word has length 80 [2024-10-13 23:33:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:01,953 INFO L471 AbstractCegarLoop]: Abstraction has 4509 states and 5974 transitions. [2024-10-13 23:33:01,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:33:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 5974 transitions. [2024-10-13 23:33:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 23:33:01,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:01,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:33:01,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:33:01,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:01,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:01,961 INFO L85 PathProgramCache]: Analyzing trace with hash -235848731, now seen corresponding path program 1 times [2024-10-13 23:33:01,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:01,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194800846] [2024-10-13 23:33:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:33:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194800846] [2024-10-13 23:33:02,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194800846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:02,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:02,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645986954] [2024-10-13 23:33:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:02,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:33:02,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:02,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:33:02,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:33:02,317 INFO L87 Difference]: Start difference. First operand 4509 states and 5974 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:33:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:06,318 INFO L93 Difference]: Finished difference Result 14274 states and 18790 transitions. [2024-10-13 23:33:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:33:06,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-13 23:33:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:06,351 INFO L225 Difference]: With dead ends: 14274 [2024-10-13 23:33:06,351 INFO L226 Difference]: Without dead ends: 9766 [2024-10-13 23:33:06,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:33:06,358 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 2159 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4750 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 5528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 4750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:06,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 185 Invalid, 5528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 4750 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 23:33:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2024-10-13 23:33:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9015. [2024-10-13 23:33:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9015 states, 9014 states have (on average 1.3037497226536499) internal successors, (11752), 9014 states have internal predecessors, (11752), 0 states have call successors, (0), 0 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:33:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9015 states to 9015 states and 11752 transitions. [2024-10-13 23:33:06,508 INFO L78 Accepts]: Start accepts. Automaton has 9015 states and 11752 transitions. Word has length 91 [2024-10-13 23:33:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:06,509 INFO L471 AbstractCegarLoop]: Abstraction has 9015 states and 11752 transitions. [2024-10-13 23:33:06,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:33:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 9015 states and 11752 transitions. [2024-10-13 23:33:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 23:33:06,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:06,518 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:33:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:33:06,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:06,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash 862310422, now seen corresponding path program 1 times [2024-10-13 23:33:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:06,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202283922] [2024-10-13 23:33:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 23:33:06,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:06,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202283922] [2024-10-13 23:33:06,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202283922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:06,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:06,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121993611] [2024-10-13 23:33:06,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:06,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:33:06,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:06,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:33:06,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:33:06,949 INFO L87 Difference]: Start difference. First operand 9015 states and 11752 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:33:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:10,438 INFO L93 Difference]: Finished difference Result 22574 states and 30202 transitions. [2024-10-13 23:33:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:33:10,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 210 [2024-10-13 23:33:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:10,476 INFO L225 Difference]: With dead ends: 22574 [2024-10-13 23:33:10,477 INFO L226 Difference]: Without dead ends: 12772 [2024-10-13 23:33:10,489 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:33:10,493 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 690 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3807 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 4470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 3807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:10,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 711 Invalid, 4470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 3807 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 23:33:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2024-10-13 23:33:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 12770. [2024-10-13 23:33:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12770 states, 12769 states have (on average 1.2170882606312163) internal successors, (15541), 12769 states have internal predecessors, (15541), 0 states have call successors, (0), 0 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:33:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12770 states to 12770 states and 15541 transitions. [2024-10-13 23:33:10,725 INFO L78 Accepts]: Start accepts. Automaton has 12770 states and 15541 transitions. Word has length 210 [2024-10-13 23:33:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:10,725 INFO L471 AbstractCegarLoop]: Abstraction has 12770 states and 15541 transitions. [2024-10-13 23:33:10,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:33:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 12770 states and 15541 transitions. [2024-10-13 23:33:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-13 23:33:10,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:10,731 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:10,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:33:10,732 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:10,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash -438198980, now seen corresponding path program 1 times [2024-10-13 23:33:10,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:10,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854578896] [2024-10-13 23:33:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 41 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:33:11,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854578896] [2024-10-13 23:33:11,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854578896] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:33:11,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334719041] [2024-10-13 23:33:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:11,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:33:11,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:33:11,149 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:33:11,151 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:33:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:11,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:33:11,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:33:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 23:33:11,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:33:11,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334719041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:11,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:33:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 23:33:11,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762005011] [2024-10-13 23:33:11,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:11,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:11,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:11,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:33:11,320 INFO L87 Difference]: Start difference. First operand 12770 states and 15541 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:14,039 INFO L93 Difference]: Finished difference Result 32298 states and 40250 transitions. [2024-10-13 23:33:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:14,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-13 23:33:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:14,076 INFO L225 Difference]: With dead ends: 32298 [2024-10-13 23:33:14,077 INFO L226 Difference]: Without dead ends: 20280 [2024-10-13 23:33:14,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:33:14,093 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 805 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:14,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 969 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:33:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20280 states. [2024-10-13 23:33:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20280 to 18778. [2024-10-13 23:33:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18778 states, 18777 states have (on average 1.2514778718645152) internal successors, (23499), 18777 states have internal predecessors, (23499), 0 states have call successors, (0), 0 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:33:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18778 states to 18778 states and 23499 transitions. [2024-10-13 23:33:14,354 INFO L78 Accepts]: Start accepts. Automaton has 18778 states and 23499 transitions. Word has length 236 [2024-10-13 23:33:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:14,355 INFO L471 AbstractCegarLoop]: Abstraction has 18778 states and 23499 transitions. [2024-10-13 23:33:14,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 18778 states and 23499 transitions. [2024-10-13 23:33:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-10-13 23:33:14,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:14,363 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:33:14,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:33:14,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:33:14,568 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:14,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1826750826, now seen corresponding path program 1 times [2024-10-13 23:33:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608271107] [2024-10-13 23:33:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 23:33:14,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:14,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608271107] [2024-10-13 23:33:14,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608271107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:14,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:14,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:14,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159708082] [2024-10-13 23:33:14,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:14,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:14,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:14,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:14,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:14,871 INFO L87 Difference]: Start difference. First operand 18778 states and 23499 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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:33:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:17,949 INFO L93 Difference]: Finished difference Result 50322 states and 64011 transitions. [2024-10-13 23:33:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:17,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 386 [2024-10-13 23:33:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:18,013 INFO L225 Difference]: With dead ends: 50322 [2024-10-13 23:33:18,013 INFO L226 Difference]: Without dead ends: 32296 [2024-10-13 23:33:18,038 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:33:18,038 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 670 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:18,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 314 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 2204 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 23:33:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32296 states. [2024-10-13 23:33:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32296 to 32296. [2024-10-13 23:33:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32296 states, 32295 states have (on average 1.2191670537234867) internal successors, (39373), 32295 states have internal predecessors, (39373), 0 states have call successors, (0), 0 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:33:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32296 states to 32296 states and 39373 transitions. [2024-10-13 23:33:18,427 INFO L78 Accepts]: Start accepts. Automaton has 32296 states and 39373 transitions. Word has length 386 [2024-10-13 23:33:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:18,428 INFO L471 AbstractCegarLoop]: Abstraction has 32296 states and 39373 transitions. [2024-10-13 23:33:18,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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:33:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 32296 states and 39373 transitions. [2024-10-13 23:33:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-10-13 23:33:18,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:18,442 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:33:18,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:33:18,443 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:18,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1491305548, now seen corresponding path program 1 times [2024-10-13 23:33:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:18,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005383224] [2024-10-13 23:33:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 23:33:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005383224] [2024-10-13 23:33:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005383224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:18,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937181748] [2024-10-13 23:33:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:18,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:18,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:18,879 INFO L87 Difference]: Start difference. First operand 32296 states and 39373 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:33:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:21,761 INFO L93 Difference]: Finished difference Result 75856 states and 94530 transitions. [2024-10-13 23:33:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:21,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 395 [2024-10-13 23:33:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:21,828 INFO L225 Difference]: With dead ends: 75856 [2024-10-13 23:33:21,828 INFO L226 Difference]: Without dead ends: 44312 [2024-10-13 23:33:21,866 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:33:21,867 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 680 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2104 mSolverCounterSat, 863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 863 IncrementalHoareTripleChecker+Valid, 2104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:21,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 330 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [863 Valid, 2104 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:33:21,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44312 states. [2024-10-13 23:33:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44312 to 44312. [2024-10-13 23:33:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44312 states, 44311 states have (on average 1.2252939450700728) internal successors, (54294), 44311 states have internal predecessors, (54294), 0 states have call successors, (0), 0 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:33:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44312 states to 44312 states and 54294 transitions. [2024-10-13 23:33:22,610 INFO L78 Accepts]: Start accepts. Automaton has 44312 states and 54294 transitions. Word has length 395 [2024-10-13 23:33:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:22,611 INFO L471 AbstractCegarLoop]: Abstraction has 44312 states and 54294 transitions. [2024-10-13 23:33:22,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:33:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 44312 states and 54294 transitions. [2024-10-13 23:33:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-10-13 23:33:22,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:22,623 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:33:22,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:33:22,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:22,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2111065490, now seen corresponding path program 1 times [2024-10-13 23:33:22,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:22,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156480182] [2024-10-13 23:33:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-10-13 23:33:22,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:22,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156480182] [2024-10-13 23:33:22,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156480182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:22,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:22,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:33:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888555416] [2024-10-13 23:33:22,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:22,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:22,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:22,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:22,905 INFO L87 Difference]: Start difference. First operand 44312 states and 54294 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:33:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:26,055 INFO L93 Difference]: Finished difference Result 120167 states and 148617 transitions. [2024-10-13 23:33:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:26,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 407 [2024-10-13 23:33:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:26,311 INFO L225 Difference]: With dead ends: 120167 [2024-10-13 23:33:26,311 INFO L226 Difference]: Without dead ends: 71350 [2024-10-13 23:33:26,367 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:33:26,371 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 817 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:26,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 321 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:33:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71350 states. [2024-10-13 23:33:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71350 to 69095. [2024-10-13 23:33:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69095 states, 69094 states have (on average 1.1719396763828986) internal successors, (80974), 69094 states have internal predecessors, (80974), 0 states have call successors, (0), 0 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:33:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69095 states to 69095 states and 80974 transitions. [2024-10-13 23:33:27,580 INFO L78 Accepts]: Start accepts. Automaton has 69095 states and 80974 transitions. Word has length 407 [2024-10-13 23:33:27,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:27,581 INFO L471 AbstractCegarLoop]: Abstraction has 69095 states and 80974 transitions. [2024-10-13 23:33:27,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:33:27,581 INFO L276 IsEmpty]: Start isEmpty. Operand 69095 states and 80974 transitions. [2024-10-13 23:33:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-10-13 23:33:27,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:27,592 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:33:27,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:33:27,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:27,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash 380675477, now seen corresponding path program 1 times [2024-10-13 23:33:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:27,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098332048] [2024-10-13 23:33:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 23:33:28,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:28,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098332048] [2024-10-13 23:33:28,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098332048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:28,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:28,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:28,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167137697] [2024-10-13 23:33:28,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:28,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:28,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:28,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:28,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:28,304 INFO L87 Difference]: Start difference. First operand 69095 states and 80974 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 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:33:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:31,158 INFO L93 Difference]: Finished difference Result 153960 states and 181219 transitions. [2024-10-13 23:33:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:31,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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 424 [2024-10-13 23:33:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:31,423 INFO L225 Difference]: With dead ends: 153960 [2024-10-13 23:33:31,423 INFO L226 Difference]: Without dead ends: 85617 [2024-10-13 23:33:31,467 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:33:31,468 INFO L432 NwaCegarLoop]: 1235 mSDtfsCounter, 696 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:31,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1242 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:33:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85617 states. [2024-10-13 23:33:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85617 to 81862. [2024-10-13 23:33:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81862 states, 81861 states have (on average 1.1589157229938554) internal successors, (94870), 81861 states have internal predecessors, (94870), 0 states have call successors, (0), 0 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:33:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81862 states to 81862 states and 94870 transitions. [2024-10-13 23:33:32,754 INFO L78 Accepts]: Start accepts. Automaton has 81862 states and 94870 transitions. Word has length 424 [2024-10-13 23:33:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:32,754 INFO L471 AbstractCegarLoop]: Abstraction has 81862 states and 94870 transitions. [2024-10-13 23:33:32,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 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:33:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 81862 states and 94870 transitions. [2024-10-13 23:33:32,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-10-13 23:33:32,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:32,769 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:33:32,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:33:32,769 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:32,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash -713057436, now seen corresponding path program 1 times [2024-10-13 23:33:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:32,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498513027] [2024-10-13 23:33:32,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:32,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-13 23:33:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498513027] [2024-10-13 23:33:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498513027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:33,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:33,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650344233] [2024-10-13 23:33:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:33,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:33,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:33,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:33,290 INFO L87 Difference]: Start difference. First operand 81862 states and 94870 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:36,253 INFO L93 Difference]: Finished difference Result 188506 states and 219993 transitions. [2024-10-13 23:33:36,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:36,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427 [2024-10-13 23:33:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:36,405 INFO L225 Difference]: With dead ends: 188506 [2024-10-13 23:33:36,405 INFO L226 Difference]: Without dead ends: 107396 [2024-10-13 23:33:36,454 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:33:36,455 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 606 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:36,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1246 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:33:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107396 states. [2024-10-13 23:33:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107396 to 102890. [2024-10-13 23:33:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102890 states, 102889 states have (on average 1.1285268590422688) internal successors, (116113), 102889 states have internal predecessors, (116113), 0 states have call successors, (0), 0 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:33:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102890 states to 102890 states and 116113 transitions. [2024-10-13 23:33:37,999 INFO L78 Accepts]: Start accepts. Automaton has 102890 states and 116113 transitions. Word has length 427 [2024-10-13 23:33:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:37,999 INFO L471 AbstractCegarLoop]: Abstraction has 102890 states and 116113 transitions. [2024-10-13 23:33:38,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 102890 states and 116113 transitions. [2024-10-13 23:33:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2024-10-13 23:33:38,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:38,007 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:38,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:33:38,007 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:38,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1767307025, now seen corresponding path program 1 times [2024-10-13 23:33:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:38,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759631176] [2024-10-13 23:33:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-13 23:33:38,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:38,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759631176] [2024-10-13 23:33:38,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759631176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:38,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:38,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:38,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952882439] [2024-10-13 23:33:38,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:38,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:38,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:38,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:38,373 INFO L87 Difference]: Start difference. First operand 102890 states and 116113 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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:33:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:41,644 INFO L93 Difference]: Finished difference Result 250088 states and 281682 transitions. [2024-10-13 23:33:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:41,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 440 [2024-10-13 23:33:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:41,839 INFO L225 Difference]: With dead ends: 250088 [2024-10-13 23:33:41,839 INFO L226 Difference]: Without dead ends: 147950 [2024-10-13 23:33:41,898 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:33:41,898 INFO L432 NwaCegarLoop]: 1238 mSDtfsCounter, 564 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:41,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1245 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:33:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147950 states. [2024-10-13 23:33:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147950 to 143444. [2024-10-13 23:33:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143444 states, 143443 states have (on average 1.118256032012716) internal successors, (160406), 143443 states have internal predecessors, (160406), 0 states have call successors, (0), 0 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:33:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143444 states to 143444 states and 160406 transitions. [2024-10-13 23:33:43,717 INFO L78 Accepts]: Start accepts. Automaton has 143444 states and 160406 transitions. Word has length 440 [2024-10-13 23:33:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:43,718 INFO L471 AbstractCegarLoop]: Abstraction has 143444 states and 160406 transitions. [2024-10-13 23:33:43,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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:33:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 143444 states and 160406 transitions. [2024-10-13 23:33:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-10-13 23:33:43,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:43,732 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:43,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:33:43,733 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:43,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash 301089674, now seen corresponding path program 1 times [2024-10-13 23:33:43,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:43,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191867773] [2024-10-13 23:33:43,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:43,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 511 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-13 23:33:44,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191867773] [2024-10-13 23:33:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191867773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:44,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582816370] [2024-10-13 23:33:44,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:44,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:44,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:44,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:44,479 INFO L87 Difference]: Start difference. First operand 143444 states and 160406 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 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:33:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:47,732 INFO L93 Difference]: Finished difference Result 290642 states and 324665 transitions. [2024-10-13 23:33:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 528 [2024-10-13 23:33:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:47,923 INFO L225 Difference]: With dead ends: 290642 [2024-10-13 23:33:47,924 INFO L226 Difference]: Without dead ends: 147950 [2024-10-13 23:33:47,998 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:33:47,999 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 734 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:47,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 214 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 23:33:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147950 states. [2024-10-13 23:33:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147950 to 143444. [2024-10-13 23:33:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143444 states, 143443 states have (on average 1.1122536477904115) internal successors, (159545), 143443 states have internal predecessors, (159545), 0 states have call successors, (0), 0 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:33:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143444 states to 143444 states and 159545 transitions. [2024-10-13 23:33:50,158 INFO L78 Accepts]: Start accepts. Automaton has 143444 states and 159545 transitions. Word has length 528 [2024-10-13 23:33:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:50,158 INFO L471 AbstractCegarLoop]: Abstraction has 143444 states and 159545 transitions. [2024-10-13 23:33:50,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 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:33:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 143444 states and 159545 transitions. [2024-10-13 23:33:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2024-10-13 23:33:50,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:50,169 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:50,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:33:50,169 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:50,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1766767273, now seen corresponding path program 1 times [2024-10-13 23:33:50,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:50,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781707441] [2024-10-13 23:33:50,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-13 23:33:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781707441] [2024-10-13 23:33:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781707441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:50,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375115480] [2024-10-13 23:33:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:50,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:50,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:50,514 INFO L87 Difference]: Start difference. First operand 143444 states and 159545 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:33:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:54,479 INFO L93 Difference]: Finished difference Result 337204 states and 377088 transitions. [2024-10-13 23:33:54,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:54,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 551 [2024-10-13 23:33:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:54,736 INFO L225 Difference]: With dead ends: 337204 [2024-10-13 23:33:54,736 INFO L226 Difference]: Without dead ends: 194512 [2024-10-13 23:33:54,795 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:33:54,798 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 535 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:54,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1235 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:33:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194512 states. [2024-10-13 23:33:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194512 to 184749. [2024-10-13 23:33:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184749 states, 184748 states have (on average 1.0961147076017062) internal successors, (202505), 184748 states have internal predecessors, (202505), 0 states have call successors, (0), 0 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:33:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184749 states to 184749 states and 202505 transitions. [2024-10-13 23:33:57,521 INFO L78 Accepts]: Start accepts. Automaton has 184749 states and 202505 transitions. Word has length 551 [2024-10-13 23:33:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:57,521 INFO L471 AbstractCegarLoop]: Abstraction has 184749 states and 202505 transitions. [2024-10-13 23:33:57,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:33:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 184749 states and 202505 transitions. [2024-10-13 23:33:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2024-10-13 23:33:57,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:57,532 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:33:57,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:33:57,532 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:57,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash -944251605, now seen corresponding path program 1 times [2024-10-13 23:33:57,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:57,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112678262] [2024-10-13 23:33:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat