./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.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 5e99154d55f7fd098c0e840b496605adea5c7214bf70234e7c54dceeadfa306b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:16:19,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:16:19,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:16:19,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:16:19,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:16:19,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:16:19,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:16:19,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:16:19,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:16:19,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:16:19,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:16:19,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:16:19,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:16:19,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:16:19,199 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:16:19,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:16:19,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:16:19,200 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:16:19,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:16:19,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:16:19,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:16:19,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:16:19,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:16:19,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:16:19,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:16:19,204 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:16:19,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:16:19,204 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:16:19,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:16:19,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:16:19,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:16:19,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:16:19,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:16:19,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:16:19,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:16:19,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:16:19,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:16:19,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:16:19,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:16:19,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:16:19,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:16:19,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:16:19,210 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 -> 5e99154d55f7fd098c0e840b496605adea5c7214bf70234e7c54dceeadfa306b [2024-11-11 21:16:19,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:16:19,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:16:19,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:16:19,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:16:19,494 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:16:19,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2024-11-11 21:16:20,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:16:21,233 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:16:21,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2024-11-11 21:16:21,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11293dee6/b84d7582f74a49d5a2d83500bb14c41d/FLAG5cc3cb890 [2024-11-11 21:16:21,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11293dee6/b84d7582f74a49d5a2d83500bb14c41d [2024-11-11 21:16:21,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:16:21,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:16:21,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:16:21,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:16:21,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:16:21,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1181210f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21, skipping insertion in model container [2024-11-11 21:16:21,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:16:21,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c[12751,12764] [2024-11-11 21:16:21,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:16:21,653 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:16:21,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c[12751,12764] [2024-11-11 21:16:21,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:16:21,748 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:16:21,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21 WrapperNode [2024-11-11 21:16:21,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:16:21,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:16:21,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:16:21,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:16:21,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,809 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 385 [2024-11-11 21:16:21,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:16:21,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:16:21,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:16:21,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:16:21,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,869 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:16:21,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:16:21,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:16:21,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:16:21,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:16:21,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (1/1) ... [2024-11-11 21:16:21,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:16:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:16:21,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:16:21,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:16:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:16:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:16:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:16:22,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:16:22,126 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:16:22,130 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:16:22,667 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-11 21:16:22,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:16:22,687 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:16:22,687 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:16:22,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:16:22 BoogieIcfgContainer [2024-11-11 21:16:22,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:16:22,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:16:22,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:16:22,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:16:22,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:16:21" (1/3) ... [2024-11-11 21:16:22,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edfcc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:16:22, skipping insertion in model container [2024-11-11 21:16:22,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:16:21" (2/3) ... [2024-11-11 21:16:22,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edfcc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:16:22, skipping insertion in model container [2024-11-11 21:16:22,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:16:22" (3/3) ... [2024-11-11 21:16:22,699 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2024-11-11 21:16:22,719 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:16:22,719 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:16:22,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:16:22,784 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;@75265c38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:16:22,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:16:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 100 states have (on average 1.75) internal successors, (175), 101 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 21:16:22,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:22,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:22,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:22,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1868146540, now seen corresponding path program 1 times [2024-11-11 21:16:22,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:22,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484550418] [2024-11-11 21:16:22,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:23,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484550418] [2024-11-11 21:16:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484550418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:23,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:23,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:16:23,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782570114] [2024-11-11 21:16:23,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:23,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:16:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:16:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:16:23,184 INFO L87 Difference]: Start difference. First operand has 102 states, 100 states have (on average 1.75) internal successors, (175), 101 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:23,212 INFO L93 Difference]: Finished difference Result 167 states and 280 transitions. [2024-11-11 21:16:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:16:23,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-11 21:16:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:23,225 INFO L225 Difference]: With dead ends: 167 [2024-11-11 21:16:23,226 INFO L226 Difference]: Without dead ends: 98 [2024-11-11 21:16:23,229 INFO L434 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-11-11 21:16:23,235 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:23,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-11 21:16:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-11 21:16:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.731958762886598) internal successors, (168), 97 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 168 transitions. [2024-11-11 21:16:23,282 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 168 transitions. Word has length 33 [2024-11-11 21:16:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:23,283 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 168 transitions. [2024-11-11 21:16:23,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 168 transitions. [2024-11-11 21:16:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 21:16:23,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:23,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:16:23,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:23,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1917347666, now seen corresponding path program 1 times [2024-11-11 21:16:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590750332] [2024-11-11 21:16:23,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590750332] [2024-11-11 21:16:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590750332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:23,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:23,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:16:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702292042] [2024-11-11 21:16:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:23,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:16:23,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:23,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:16:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:16:23,619 INFO L87 Difference]: Start difference. First operand 98 states and 168 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:23,733 INFO L93 Difference]: Finished difference Result 162 states and 270 transitions. [2024-11-11 21:16:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:16:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-11 21:16:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:23,735 INFO L225 Difference]: With dead ends: 162 [2024-11-11 21:16:23,735 INFO L226 Difference]: Without dead ends: 98 [2024-11-11 21:16:23,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:16:23,741 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:23,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 627 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-11 21:16:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-11 21:16:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-11-11 21:16:23,751 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 33 [2024-11-11 21:16:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:23,752 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-11-11 21:16:23,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-11-11 21:16:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 21:16:23,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:23,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:23,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:16:23,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:23,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash 13017383, now seen corresponding path program 1 times [2024-11-11 21:16:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710869731] [2024-11-11 21:16:23,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710869731] [2024-11-11 21:16:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710869731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:23,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:23,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:23,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059826641] [2024-11-11 21:16:23,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:23,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:23,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:23,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:23,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:23,924 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:23,974 INFO L93 Difference]: Finished difference Result 210 states and 318 transitions. [2024-11-11 21:16:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:23,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-11-11 21:16:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:23,980 INFO L225 Difference]: With dead ends: 210 [2024-11-11 21:16:23,980 INFO L226 Difference]: Without dead ends: 150 [2024-11-11 21:16:23,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:23,982 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 82 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:23,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-11 21:16:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2024-11-11 21:16:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.4829931972789117) internal successors, (218), 147 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2024-11-11 21:16:24,003 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 64 [2024-11-11 21:16:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:24,004 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2024-11-11 21:16:24,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2024-11-11 21:16:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 21:16:24,006 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:24,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:24,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:16:24,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:24,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash -586300056, now seen corresponding path program 1 times [2024-11-11 21:16:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835376822] [2024-11-11 21:16:24,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835376822] [2024-11-11 21:16:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835376822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:24,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:24,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64055633] [2024-11-11 21:16:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:24,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:24,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:24,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:24,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:24,216 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:24,258 INFO L93 Difference]: Finished difference Result 352 states and 550 transitions. [2024-11-11 21:16:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:24,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-11-11 21:16:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:24,261 INFO L225 Difference]: With dead ends: 352 [2024-11-11 21:16:24,263 INFO L226 Difference]: Without dead ends: 242 [2024-11-11 21:16:24,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:24,265 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 78 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:24,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 295 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-11 21:16:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2024-11-11 21:16:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.5355648535564854) internal successors, (367), 239 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 367 transitions. [2024-11-11 21:16:24,281 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 367 transitions. Word has length 64 [2024-11-11 21:16:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:24,281 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 367 transitions. [2024-11-11 21:16:24,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 367 transitions. [2024-11-11 21:16:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 21:16:24,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:24,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:24,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:16:24,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:24,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 592130601, now seen corresponding path program 1 times [2024-11-11 21:16:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:24,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769163897] [2024-11-11 21:16:24,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:24,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:24,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:24,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769163897] [2024-11-11 21:16:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769163897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:24,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:16:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968695290] [2024-11-11 21:16:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:24,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:16:24,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:24,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:16:24,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:16:24,517 INFO L87 Difference]: Start difference. First operand 240 states and 367 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:24,708 INFO L93 Difference]: Finished difference Result 1452 states and 2341 transitions. [2024-11-11 21:16:24,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:16:24,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-11-11 21:16:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:24,716 INFO L225 Difference]: With dead ends: 1452 [2024-11-11 21:16:24,717 INFO L226 Difference]: Without dead ends: 1250 [2024-11-11 21:16:24,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:16:24,722 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1357 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:24,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 974 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-11 21:16:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 440. [2024-11-11 21:16:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.5649202733485195) internal successors, (687), 439 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 687 transitions. [2024-11-11 21:16:24,771 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 687 transitions. Word has length 64 [2024-11-11 21:16:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:24,771 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 687 transitions. [2024-11-11 21:16:24,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 687 transitions. [2024-11-11 21:16:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:16:24,773 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:24,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:24,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:16:24,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:24,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash 792856163, now seen corresponding path program 1 times [2024-11-11 21:16:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:24,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56714454] [2024-11-11 21:16:24,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:24,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56714454] [2024-11-11 21:16:25,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56714454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:25,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:25,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:16:25,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5576865] [2024-11-11 21:16:25,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:25,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:16:25,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:25,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:16:25,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:16:25,088 INFO L87 Difference]: Start difference. First operand 440 states and 687 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:25,118 INFO L93 Difference]: Finished difference Result 466 states and 720 transitions. [2024-11-11 21:16:25,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:16:25,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-11 21:16:25,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:25,124 INFO L225 Difference]: With dead ends: 466 [2024-11-11 21:16:25,125 INFO L226 Difference]: Without dead ends: 464 [2024-11-11 21:16:25,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:16:25,127 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:25,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 524 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-11 21:16:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2024-11-11 21:16:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.5356371490280778) internal successors, (711), 463 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 711 transitions. [2024-11-11 21:16:25,152 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 711 transitions. Word has length 65 [2024-11-11 21:16:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:25,156 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 711 transitions. [2024-11-11 21:16:25,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 711 transitions. [2024-11-11 21:16:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:16:25,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:25,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:25,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:16:25,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:25,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:25,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1138684095, now seen corresponding path program 1 times [2024-11-11 21:16:25,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:25,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697019781] [2024-11-11 21:16:25,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:25,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:25,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:25,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697019781] [2024-11-11 21:16:25,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697019781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:25,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:25,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:25,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149130385] [2024-11-11 21:16:25,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:25,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:25,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:25,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:25,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:25,278 INFO L87 Difference]: Start difference. First operand 464 states and 711 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:25,307 INFO L93 Difference]: Finished difference Result 1256 states and 1957 transitions. [2024-11-11 21:16:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:25,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-11-11 21:16:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:25,313 INFO L225 Difference]: With dead ends: 1256 [2024-11-11 21:16:25,314 INFO L226 Difference]: Without dead ends: 830 [2024-11-11 21:16:25,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:25,318 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 63 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:25,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 231 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-11 21:16:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 828. [2024-11-11 21:16:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.5417170495767836) internal successors, (1275), 827 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1275 transitions. [2024-11-11 21:16:25,344 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1275 transitions. Word has length 66 [2024-11-11 21:16:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:25,345 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1275 transitions. [2024-11-11 21:16:25,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,345 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1275 transitions. [2024-11-11 21:16:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:16:25,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:25,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:25,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:16:25,349 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:25,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1571823680, now seen corresponding path program 1 times [2024-11-11 21:16:25,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:25,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022062981] [2024-11-11 21:16:25,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:25,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:25,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022062981] [2024-11-11 21:16:25,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022062981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:25,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:25,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:25,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93179266] [2024-11-11 21:16:25,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:25,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:25,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:25,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:25,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:25,425 INFO L87 Difference]: Start difference. First operand 828 states and 1275 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:25,469 INFO L93 Difference]: Finished difference Result 1618 states and 2512 transitions. [2024-11-11 21:16:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:25,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-11-11 21:16:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:25,475 INFO L225 Difference]: With dead ends: 1618 [2024-11-11 21:16:25,475 INFO L226 Difference]: Without dead ends: 1192 [2024-11-11 21:16:25,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:25,478 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 86 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:25,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 308 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-11 21:16:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1190. [2024-11-11 21:16:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 1.5382674516400336) internal successors, (1829), 1189 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1829 transitions. [2024-11-11 21:16:25,514 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1829 transitions. Word has length 66 [2024-11-11 21:16:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:25,515 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1829 transitions. [2024-11-11 21:16:25,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1829 transitions. [2024-11-11 21:16:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:16:25,517 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:25,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:25,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:16:25,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:25,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1973579108, now seen corresponding path program 1 times [2024-11-11 21:16:25,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:25,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598571796] [2024-11-11 21:16:25,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:25,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:25,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:25,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598571796] [2024-11-11 21:16:25,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598571796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:25,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:25,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:25,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295175037] [2024-11-11 21:16:25,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:25,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:25,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:25,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:25,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:25,611 INFO L87 Difference]: Start difference. First operand 1190 states and 1829 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:25,660 INFO L93 Difference]: Finished difference Result 3298 states and 5071 transitions. [2024-11-11 21:16:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:25,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-11 21:16:25,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:25,669 INFO L225 Difference]: With dead ends: 3298 [2024-11-11 21:16:25,670 INFO L226 Difference]: Without dead ends: 2148 [2024-11-11 21:16:25,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:25,673 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 70 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:25,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 289 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2024-11-11 21:16:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2146. [2024-11-11 21:16:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2145 states have (on average 1.5184149184149185) internal successors, (3257), 2145 states have internal predecessors, (3257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3257 transitions. [2024-11-11 21:16:25,736 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3257 transitions. Word has length 67 [2024-11-11 21:16:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:25,736 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 3257 transitions. [2024-11-11 21:16:25,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3257 transitions. [2024-11-11 21:16:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:16:25,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:25,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:25,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:16:25,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:25,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 520699260, now seen corresponding path program 1 times [2024-11-11 21:16:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:25,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75456159] [2024-11-11 21:16:25,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:25,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75456159] [2024-11-11 21:16:25,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75456159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:25,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:25,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:25,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878368550] [2024-11-11 21:16:25,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:25,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:25,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:25,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:25,820 INFO L87 Difference]: Start difference. First operand 2146 states and 3257 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:25,893 INFO L93 Difference]: Finished difference Result 5974 states and 9019 transitions. [2024-11-11 21:16:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:25,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-11 21:16:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:25,908 INFO L225 Difference]: With dead ends: 5974 [2024-11-11 21:16:25,909 INFO L226 Difference]: Without dead ends: 3868 [2024-11-11 21:16:25,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:25,913 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 74 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:25,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 302 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2024-11-11 21:16:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3866. [2024-11-11 21:16:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 3865 states have (on average 1.4884864165588616) internal successors, (5753), 3865 states have internal predecessors, (5753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 5753 transitions. [2024-11-11 21:16:26,081 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 5753 transitions. Word has length 67 [2024-11-11 21:16:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:26,082 INFO L471 AbstractCegarLoop]: Abstraction has 3866 states and 5753 transitions. [2024-11-11 21:16:26,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 5753 transitions. [2024-11-11 21:16:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:16:26,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:26,086 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:26,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:16:26,086 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:26,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1414914730, now seen corresponding path program 1 times [2024-11-11 21:16:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:26,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256611663] [2024-11-11 21:16:26,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:26,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:26,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256611663] [2024-11-11 21:16:26,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256611663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:26,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:26,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:26,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16679960] [2024-11-11 21:16:26,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:26,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:26,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:26,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:26,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:26,262 INFO L87 Difference]: Start difference. First operand 3866 states and 5753 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:26,349 INFO L93 Difference]: Finished difference Result 7694 states and 11467 transitions. [2024-11-11 21:16:26,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:26,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-11 21:16:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:26,365 INFO L225 Difference]: With dead ends: 7694 [2024-11-11 21:16:26,366 INFO L226 Difference]: Without dead ends: 3868 [2024-11-11 21:16:26,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:26,372 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 67 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:26,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 294 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2024-11-11 21:16:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3866. [2024-11-11 21:16:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 3865 states have (on average 1.4760672703751616) internal successors, (5705), 3865 states have internal predecessors, (5705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 5705 transitions. [2024-11-11 21:16:26,487 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 5705 transitions. Word has length 93 [2024-11-11 21:16:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:26,487 INFO L471 AbstractCegarLoop]: Abstraction has 3866 states and 5705 transitions. [2024-11-11 21:16:26,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 5705 transitions. [2024-11-11 21:16:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:16:26,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:26,490 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:26,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:16:26,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:26,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -70108759, now seen corresponding path program 1 times [2024-11-11 21:16:26,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:26,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9146640] [2024-11-11 21:16:26,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:26,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:26,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:26,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9146640] [2024-11-11 21:16:26,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9146640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:26,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:26,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:26,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710487213] [2024-11-11 21:16:26,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:26,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:26,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:26,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:26,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:26,648 INFO L87 Difference]: Start difference. First operand 3866 states and 5705 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:26,707 INFO L93 Difference]: Finished difference Result 5782 states and 8539 transitions. [2024-11-11 21:16:26,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-11 21:16:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:26,716 INFO L225 Difference]: With dead ends: 5782 [2024-11-11 21:16:26,717 INFO L226 Difference]: Without dead ends: 1956 [2024-11-11 21:16:26,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:26,723 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 61 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:26,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 275 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2024-11-11 21:16:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1954. [2024-11-11 21:16:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1953 states have (on average 1.4587813620071686) internal successors, (2849), 1953 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2849 transitions. [2024-11-11 21:16:26,785 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2849 transitions. Word has length 93 [2024-11-11 21:16:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:26,785 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 2849 transitions. [2024-11-11 21:16:26,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2849 transitions. [2024-11-11 21:16:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:16:26,787 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:26,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:26,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:16:26,788 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:26,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash 316139560, now seen corresponding path program 1 times [2024-11-11 21:16:26,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:26,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990996166] [2024-11-11 21:16:26,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:26,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:28,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990996166] [2024-11-11 21:16:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990996166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:16:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134507511] [2024-11-11 21:16:28,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:28,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:16:28,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:16:28,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:16:28,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:16:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:28,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 21:16:28,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:16:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:29,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:16:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:30,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134507511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:16:30,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:16:30,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 26 [2024-11-11 21:16:30,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335763639] [2024-11-11 21:16:30,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:16:30,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 21:16:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:30,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 21:16:30,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-11-11 21:16:30,805 INFO L87 Difference]: Start difference. First operand 1954 states and 2849 transitions. Second operand has 26 states, 26 states have (on average 10.307692307692308) internal successors, (268), 26 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:43,123 INFO L93 Difference]: Finished difference Result 22174 states and 31982 transitions. [2024-11-11 21:16:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-11-11 21:16:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.307692307692308) internal successors, (268), 26 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-11 21:16:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:43,192 INFO L225 Difference]: With dead ends: 22174 [2024-11-11 21:16:43,192 INFO L226 Difference]: Without dead ends: 20260 [2024-11-11 21:16:43,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8596 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3431, Invalid=19825, Unknown=0, NotChecked=0, Total=23256 [2024-11-11 21:16:43,208 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 12685 mSDsluCounter, 2535 mSDsCounter, 0 mSdLazyCounter, 2745 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12685 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 2745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:43,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12685 Valid, 2732 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 2745 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 21:16:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20260 states. [2024-11-11 21:16:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20260 to 13992. [2024-11-11 21:16:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13992 states, 13991 states have (on average 1.4315631477378314) internal successors, (20029), 13991 states have internal predecessors, (20029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13992 states to 13992 states and 20029 transitions. [2024-11-11 21:16:43,782 INFO L78 Accepts]: Start accepts. Automaton has 13992 states and 20029 transitions. Word has length 93 [2024-11-11 21:16:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:43,782 INFO L471 AbstractCegarLoop]: Abstraction has 13992 states and 20029 transitions. [2024-11-11 21:16:43,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.307692307692308) internal successors, (268), 26 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 13992 states and 20029 transitions. [2024-11-11 21:16:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 21:16:43,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:43,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:43,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:16:43,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 21:16:43,990 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:43,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1162308652, now seen corresponding path program 1 times [2024-11-11 21:16:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:43,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586076872] [2024-11-11 21:16:43,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:16:44,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:44,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586076872] [2024-11-11 21:16:44,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586076872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:44,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:44,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:16:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121274691] [2024-11-11 21:16:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:44,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:16:44,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:44,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:16:44,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:16:44,233 INFO L87 Difference]: Start difference. First operand 13992 states and 20029 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:44,973 INFO L93 Difference]: Finished difference Result 48404 states and 69624 transitions. [2024-11-11 21:16:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:16:44,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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 94 [2024-11-11 21:16:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:45,057 INFO L225 Difference]: With dead ends: 48404 [2024-11-11 21:16:45,057 INFO L226 Difference]: Without dead ends: 41722 [2024-11-11 21:16:45,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:16:45,075 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 859 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:45,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1179 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41722 states. [2024-11-11 21:16:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41722 to 20434. [2024-11-11 21:16:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20434 states, 20433 states have (on average 1.4259286448392308) internal successors, (29136), 20433 states have internal predecessors, (29136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20434 states to 20434 states and 29136 transitions. [2024-11-11 21:16:45,954 INFO L78 Accepts]: Start accepts. Automaton has 20434 states and 29136 transitions. Word has length 94 [2024-11-11 21:16:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:45,955 INFO L471 AbstractCegarLoop]: Abstraction has 20434 states and 29136 transitions. [2024-11-11 21:16:45,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 20434 states and 29136 transitions. [2024-11-11 21:16:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 21:16:45,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:45,957 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:45,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:16:45,958 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:45,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1612149998, now seen corresponding path program 1 times [2024-11-11 21:16:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:45,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158372401] [2024-11-11 21:16:45,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:16:46,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158372401] [2024-11-11 21:16:46,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158372401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:46,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:46,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:16:46,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171185083] [2024-11-11 21:16:46,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:46,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:16:46,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:46,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:16:46,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:16:46,154 INFO L87 Difference]: Start difference. First operand 20434 states and 29136 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:47,260 INFO L93 Difference]: Finished difference Result 55166 states and 79219 transitions. [2024-11-11 21:16:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:16:47,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 94 [2024-11-11 21:16:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:47,343 INFO L225 Difference]: With dead ends: 55166 [2024-11-11 21:16:47,343 INFO L226 Difference]: Without dead ends: 48140 [2024-11-11 21:16:47,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:16:47,362 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 860 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:47,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1091 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48140 states. [2024-11-11 21:16:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48140 to 27196. [2024-11-11 21:16:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27196 states, 27195 states have (on average 1.423901452472881) internal successors, (38723), 27195 states have internal predecessors, (38723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27196 states to 27196 states and 38723 transitions. [2024-11-11 21:16:48,470 INFO L78 Accepts]: Start accepts. Automaton has 27196 states and 38723 transitions. Word has length 94 [2024-11-11 21:16:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:48,471 INFO L471 AbstractCegarLoop]: Abstraction has 27196 states and 38723 transitions. [2024-11-11 21:16:48,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27196 states and 38723 transitions. [2024-11-11 21:16:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 21:16:48,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:48,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:48,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:16:48,474 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:48,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:48,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1089333553, now seen corresponding path program 1 times [2024-11-11 21:16:48,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:48,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981316937] [2024-11-11 21:16:48,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:48,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:16:48,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981316937] [2024-11-11 21:16:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981316937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:48,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:16:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669385562] [2024-11-11 21:16:48,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:48,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:16:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:16:48,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:16:48,634 INFO L87 Difference]: Start difference. First operand 27196 states and 38723 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:49,801 INFO L93 Difference]: Finished difference Result 61912 states and 88779 transitions. [2024-11-11 21:16:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:16:49,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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 94 [2024-11-11 21:16:49,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:49,914 INFO L225 Difference]: With dead ends: 61912 [2024-11-11 21:16:49,914 INFO L226 Difference]: Without dead ends: 54886 [2024-11-11 21:16:49,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:16:49,940 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 958 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:49,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1034 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54886 states. [2024-11-11 21:16:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54886 to 33949. [2024-11-11 21:16:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33949 states, 33948 states have (on average 1.4225874867444326) internal successors, (48294), 33948 states have internal predecessors, (48294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33949 states to 33949 states and 48294 transitions. [2024-11-11 21:16:51,325 INFO L78 Accepts]: Start accepts. Automaton has 33949 states and 48294 transitions. Word has length 94 [2024-11-11 21:16:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:51,327 INFO L471 AbstractCegarLoop]: Abstraction has 33949 states and 48294 transitions. [2024-11-11 21:16:51,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 33949 states and 48294 transitions. [2024-11-11 21:16:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 21:16:51,334 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:51,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:51,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:16:51,335 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:51,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:51,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1000709459, now seen corresponding path program 1 times [2024-11-11 21:16:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:51,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289735148] [2024-11-11 21:16:51,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:51,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:16:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289735148] [2024-11-11 21:16:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289735148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:51,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:51,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:16:51,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493101191] [2024-11-11 21:16:51,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:51,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:16:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:51,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:16:51,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:16:51,530 INFO L87 Difference]: Start difference. First operand 33949 states and 48294 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:52,930 INFO L93 Difference]: Finished difference Result 68656 states and 98329 transitions. [2024-11-11 21:16:52,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:16:52,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 94 [2024-11-11 21:16:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:53,029 INFO L225 Difference]: With dead ends: 68656 [2024-11-11 21:16:53,029 INFO L226 Difference]: Without dead ends: 61606 [2024-11-11 21:16:53,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:16:53,051 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 908 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:53,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1119 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61606 states. [2024-11-11 21:16:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61606 to 40693. [2024-11-11 21:16:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40693 states, 40692 states have (on average 1.421114715423179) internal successors, (57828), 40692 states have internal predecessors, (57828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40693 states to 40693 states and 57828 transitions. [2024-11-11 21:16:54,383 INFO L78 Accepts]: Start accepts. Automaton has 40693 states and 57828 transitions. Word has length 94 [2024-11-11 21:16:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:54,384 INFO L471 AbstractCegarLoop]: Abstraction has 40693 states and 57828 transitions. [2024-11-11 21:16:54,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 40693 states and 57828 transitions. [2024-11-11 21:16:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 21:16:54,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:54,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:54,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:16:54,388 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:54,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1114635887, now seen corresponding path program 1 times [2024-11-11 21:16:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784555323] [2024-11-11 21:16:54,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 21:16:54,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:54,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784555323] [2024-11-11 21:16:54,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784555323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:54,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:54,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:16:54,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124752275] [2024-11-11 21:16:54,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:54,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:16:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:54,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:16:54,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:16:54,596 INFO L87 Difference]: Start difference. First operand 40693 states and 57828 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:56,254 INFO L93 Difference]: Finished difference Result 75400 states and 107863 transitions. [2024-11-11 21:16:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:16:56,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 94 [2024-11-11 21:16:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:56,354 INFO L225 Difference]: With dead ends: 75400 [2024-11-11 21:16:56,354 INFO L226 Difference]: Without dead ends: 68350 [2024-11-11 21:16:56,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:16:56,374 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 794 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:56,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1261 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:16:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68350 states. [2024-11-11 21:16:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68350 to 47486. [2024-11-11 21:16:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47486 states, 47485 states have (on average 1.4202169106033484) internal successors, (67439), 47485 states have internal predecessors, (67439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47486 states to 47486 states and 67439 transitions. [2024-11-11 21:16:57,867 INFO L78 Accepts]: Start accepts. Automaton has 47486 states and 67439 transitions. Word has length 94 [2024-11-11 21:16:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:57,868 INFO L471 AbstractCegarLoop]: Abstraction has 47486 states and 67439 transitions. [2024-11-11 21:16:57,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:16:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 47486 states and 67439 transitions. [2024-11-11 21:16:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 21:16:57,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:57,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:57,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:16:57,871 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:57,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash -959048686, now seen corresponding path program 1 times [2024-11-11 21:16:57,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:57,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531132967] [2024-11-11 21:16:57,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:57,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:58,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531132967] [2024-11-11 21:16:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531132967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:16:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101581513] [2024-11-11 21:16:58,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:58,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:16:58,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:16:58,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:16:58,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:16:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:58,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 21:16:58,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:16:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:59,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:17:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:17:00,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101581513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:17:00,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:17:00,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-11 21:17:00,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519973145] [2024-11-11 21:17:00,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:17:00,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:17:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:17:00,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:17:00,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:17:00,529 INFO L87 Difference]: Start difference. First operand 47486 states and 67439 transitions. Second operand has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 20 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:17:03,859 INFO L93 Difference]: Finished difference Result 193664 states and 275072 transitions. [2024-11-11 21:17:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:17:03,860 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 20 states have internal predecessors, (220), 0 states have call successors, (0), 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 97 [2024-11-11 21:17:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:17:04,054 INFO L225 Difference]: With dead ends: 193664 [2024-11-11 21:17:04,055 INFO L226 Difference]: Without dead ends: 146735 [2024-11-11 21:17:04,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=329, Invalid=931, Unknown=0, NotChecked=0, Total=1260 [2024-11-11 21:17:04,093 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1886 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:17:04,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1886 Valid, 1008 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:17:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146735 states. [2024-11-11 21:17:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146735 to 108816. [2024-11-11 21:17:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108816 states, 108815 states have (on average 1.4103202683453568) internal successors, (153464), 108815 states have internal predecessors, (153464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108816 states to 108816 states and 153464 transitions. [2024-11-11 21:17:07,962 INFO L78 Accepts]: Start accepts. Automaton has 108816 states and 153464 transitions. Word has length 97 [2024-11-11 21:17:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:17:07,963 INFO L471 AbstractCegarLoop]: Abstraction has 108816 states and 153464 transitions. [2024-11-11 21:17:07,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 20 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 108816 states and 153464 transitions. [2024-11-11 21:17:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 21:17:07,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:17:07,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:17:07,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:17:08,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:17:08,168 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:17:08,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:17:08,168 INFO L85 PathProgramCache]: Analyzing trace with hash 695908502, now seen corresponding path program 1 times [2024-11-11 21:17:08,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:17:08,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731323789] [2024-11-11 21:17:08,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:17:08,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:17:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:17:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:17:09,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:17:09,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731323789] [2024-11-11 21:17:09,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731323789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:17:09,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453190402] [2024-11-11 21:17:09,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:17:09,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:17:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:17:09,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:17:09,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:17:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:17:09,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-11 21:17:09,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:17:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:17:10,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:17:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:17:12,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453190402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:17:12,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:17:12,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 33 [2024-11-11 21:17:12,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897403255] [2024-11-11 21:17:12,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:17:12,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-11 21:17:12,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:17:12,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-11 21:17:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2024-11-11 21:17:12,044 INFO L87 Difference]: Start difference. First operand 108816 states and 153464 transitions. Second operand has 33 states, 33 states have (on average 8.272727272727273) internal successors, (273), 33 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:17:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:17:18,262 INFO L93 Difference]: Finished difference Result 377872 states and 535878 transitions. [2024-11-11 21:17:18,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 21:17:18,263 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.272727272727273) internal successors, (273), 33 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-11 21:17:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:17:18,663 INFO L225 Difference]: With dead ends: 377872 [2024-11-11 21:17:18,663 INFO L226 Difference]: Without dead ends: 269138 [2024-11-11 21:17:18,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=569, Invalid=1981, Unknown=0, NotChecked=0, Total=2550 [2024-11-11 21:17:18,772 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1680 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:17:18,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 1264 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:17:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269138 states.