./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.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 e82362cf624f0e845caa7a60d1834859999824a1181a9b545ac94ec06fd3aa08 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:31:55,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:31:55,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:31:55,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:31:55,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:31:55,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:31:55,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:31:55,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:31:55,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:31:55,796 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:31:55,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:31:55,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:31:55,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:31:55,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:31:55,798 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:31:55,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:31:55,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:31:55,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:31:55,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:31:55,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:31:55,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:31:55,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:31:55,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:31:55,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:31:55,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:31:55,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:31:55,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:31:55,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:31:55,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:31:55,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:31:55,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:31:55,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:31:55,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:31:55,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:31:55,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:31:55,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:31:55,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:31:55,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:31:55,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:31:55,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:31:55,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:31:55,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:31:55,811 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 -> e82362cf624f0e845caa7a60d1834859999824a1181a9b545ac94ec06fd3aa08 [2024-11-19 22:31:56,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:31:56,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:31:56,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:31:56,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:31:56,082 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:31:56,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c [2024-11-19 22:31:57,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:31:57,701 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:31:57,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c [2024-11-19 22:31:57,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbb5a257/b5eaeb4f4bd445e8bcb386b607b65b5f/FLAG738063114 [2024-11-19 22:31:57,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbb5a257/b5eaeb4f4bd445e8bcb386b607b65b5f [2024-11-19 22:31:57,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:31:57,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:31:57,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:31:57,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:31:57,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:31:57,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:31:57" (1/1) ... [2024-11-19 22:31:57,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45348571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:57, skipping insertion in model container [2024-11-19 22:31:57,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:31:57" (1/1) ... [2024-11-19 22:31:57,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:31:58,115 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.8.ufo.UNBOUNDED.pals.c[26481,26494] [2024-11-19 22:31:58,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:31:58,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:31:58,202 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.8.ufo.UNBOUNDED.pals.c[26481,26494] [2024-11-19 22:31:58,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:31:58,230 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:31:58,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58 WrapperNode [2024-11-19 22:31:58,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:31:58,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:31:58,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:31:58,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:31:58,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,291 INFO L138 Inliner]: procedures = 28, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 530 [2024-11-19 22:31:58,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:31:58,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:31:58,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:31:58,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:31:58,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,333 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-19 22:31:58,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:31:58,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:31:58,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:31:58,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:31:58,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (1/1) ... [2024-11-19 22:31:58,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:31:58,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:31:58,406 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-19 22:31:58,412 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-19 22:31:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:31:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:31:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:31:58,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:31:58,600 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:31:58,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:31:59,112 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-19 22:31:59,114 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:31:59,131 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:31:59,132 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 22:31:59,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:31:59 BoogieIcfgContainer [2024-11-19 22:31:59,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:31:59,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:31:59,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:31:59,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:31:59,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:31:57" (1/3) ... [2024-11-19 22:31:59,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b84f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:31:59, skipping insertion in model container [2024-11-19 22:31:59,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:31:58" (2/3) ... [2024-11-19 22:31:59,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b84f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:31:59, skipping insertion in model container [2024-11-19 22:31:59,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:31:59" (3/3) ... [2024-11-19 22:31:59,141 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals.c [2024-11-19 22:31:59,155 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:31:59,155 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:31:59,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:31:59,246 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;@39ab826, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:31:59,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:31:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 131 states have (on average 1.7938931297709924) internal successors, (235), 132 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-19 22:31:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 22:31:59,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:31:59,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:31:59,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:31:59,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:31:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1185784111, now seen corresponding path program 1 times [2024-11-19 22:31:59,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:31:59,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923836699] [2024-11-19 22:31:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:31:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:31:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:31:59,616 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-19 22:31:59,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:31:59,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923836699] [2024-11-19 22:31:59,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923836699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:31:59,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:31:59,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:31:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757658969] [2024-11-19 22:31:59,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:31:59,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 22:31:59,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:31:59,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 22:31:59,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:31:59,643 INFO L87 Difference]: Start difference. First operand has 133 states, 131 states have (on average 1.7938931297709924) internal successors, (235), 132 states have internal predecessors, (235), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-19 22:31:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:31:59,665 INFO L93 Difference]: Finished difference Result 196 states and 339 transitions. [2024-11-19 22:31:59,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 22:31:59,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-19 22:31:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:31:59,674 INFO L225 Difference]: With dead ends: 196 [2024-11-19 22:31:59,674 INFO L226 Difference]: Without dead ends: 129 [2024-11-19 22:31:59,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:31:59,679 INFO L432 NwaCegarLoop]: 228 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, 228 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-19 22:31:59,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:31:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-19 22:31:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-19 22:31:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.78125) internal successors, (228), 128 states have internal predecessors, (228), 0 states have call successors, (0), 0 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-19 22:31:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 228 transitions. [2024-11-19 22:31:59,716 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 228 transitions. Word has length 29 [2024-11-19 22:31:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:31:59,717 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 228 transitions. [2024-11-19 22:31:59,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-19 22:31:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 228 transitions. [2024-11-19 22:31:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 22:31:59,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:31:59,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:31:59,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:31:59,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:31:59,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:31:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1319797617, now seen corresponding path program 1 times [2024-11-19 22:31:59,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:31:59,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276122962] [2024-11-19 22:31:59,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:31:59,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:31:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:00,052 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-19 22:32:00,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:00,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276122962] [2024-11-19 22:32:00,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276122962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:00,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:00,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:32:00,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115360298] [2024-11-19 22:32:00,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:00,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:32:00,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:32:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:32:00,063 INFO L87 Difference]: Start difference. First operand 129 states and 228 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-19 22:32:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:00,247 INFO L93 Difference]: Finished difference Result 195 states and 332 transitions. [2024-11-19 22:32:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:32:00,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-19 22:32:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:00,252 INFO L225 Difference]: With dead ends: 195 [2024-11-19 22:32:00,254 INFO L226 Difference]: Without dead ends: 129 [2024-11-19 22:32:00,255 INFO L431 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-19 22:32:00,256 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:00,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 838 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:32:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-19 22:32:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-19 22:32:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.3046875) internal successors, (167), 128 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-19 22:32:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2024-11-19 22:32:00,270 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 29 [2024-11-19 22:32:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:00,271 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2024-11-19 22:32:00,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-19 22:32:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2024-11-19 22:32:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 22:32:00,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:00,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:00,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:32:00,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:00,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1496007295, now seen corresponding path program 1 times [2024-11-19 22:32:00,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:00,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293790325] [2024-11-19 22:32:00,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:00,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:00,715 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-19 22:32:00,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293790325] [2024-11-19 22:32:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293790325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:00,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:00,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:32:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501924032] [2024-11-19 22:32:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:00,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 22:32:00,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:00,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 22:32:00,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:32:00,724 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-19 22:32:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:01,416 INFO L93 Difference]: Finished difference Result 1121 states and 1767 transitions. [2024-11-19 22:32:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 22:32:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-19 22:32:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:01,427 INFO L225 Difference]: With dead ends: 1121 [2024-11-19 22:32:01,427 INFO L226 Difference]: Without dead ends: 1059 [2024-11-19 22:32:01,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:32:01,431 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1981 mSDsluCounter, 4380 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1981 SdHoareTripleChecker+Valid, 4541 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:01,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1981 Valid, 4541 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:32:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-19 22:32:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 189. [2024-11-19 22:32:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.4042553191489362) internal successors, (264), 188 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-19 22:32:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 264 transitions. [2024-11-19 22:32:01,471 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 264 transitions. Word has length 89 [2024-11-19 22:32:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:01,472 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 264 transitions. [2024-11-19 22:32:01,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-19 22:32:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 264 transitions. [2024-11-19 22:32:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 22:32:01,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:01,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:01,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:32:01,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:01,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1728245231, now seen corresponding path program 1 times [2024-11-19 22:32:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702837041] [2024-11-19 22:32:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:01,673 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-19 22:32:01,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:01,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702837041] [2024-11-19 22:32:01,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702837041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:01,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:32:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911007814] [2024-11-19 22:32:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:01,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:32:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:32:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:01,676 INFO L87 Difference]: Start difference. First operand 189 states and 264 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:32:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:01,706 INFO L93 Difference]: Finished difference Result 422 states and 639 transitions. [2024-11-19 22:32:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:32:01,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-19 22:32:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:01,708 INFO L225 Difference]: With dead ends: 422 [2024-11-19 22:32:01,709 INFO L226 Difference]: Without dead ends: 300 [2024-11-19 22:32:01,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:01,710 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 69 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:01,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 256 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:32:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-19 22:32:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2024-11-19 22:32:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.471186440677966) internal successors, (434), 295 states have internal predecessors, (434), 0 states have call successors, (0), 0 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-19 22:32:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 434 transitions. [2024-11-19 22:32:01,722 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 434 transitions. Word has length 91 [2024-11-19 22:32:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:01,723 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 434 transitions. [2024-11-19 22:32:01,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:32:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 434 transitions. [2024-11-19 22:32:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 22:32:01,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:01,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:01,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:32:01,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:01,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:01,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1794738743, now seen corresponding path program 1 times [2024-11-19 22:32:01,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:01,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693622713] [2024-11-19 22:32:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:01,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:02,300 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-19 22:32:02,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:02,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693622713] [2024-11-19 22:32:02,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693622713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:02,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:02,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:32:02,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027175680] [2024-11-19 22:32:02,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:02,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 22:32:02,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:02,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 22:32:02,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:32:02,305 INFO L87 Difference]: Start difference. First operand 296 states and 434 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:32:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:02,802 INFO L93 Difference]: Finished difference Result 527 states and 802 transitions. [2024-11-19 22:32:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 22:32:02,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-19 22:32:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:02,805 INFO L225 Difference]: With dead ends: 527 [2024-11-19 22:32:02,805 INFO L226 Difference]: Without dead ends: 298 [2024-11-19 22:32:02,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-19 22:32:02,808 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 644 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:02,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 840 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:32:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-19 22:32:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2024-11-19 22:32:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.464406779661017) internal successors, (432), 295 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-19 22:32:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 432 transitions. [2024-11-19 22:32:02,820 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 432 transitions. Word has length 91 [2024-11-19 22:32:02,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:02,820 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 432 transitions. [2024-11-19 22:32:02,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:32:02,821 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 432 transitions. [2024-11-19 22:32:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 22:32:02,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:02,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:02,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:32:02,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:02,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash -612396632, now seen corresponding path program 1 times [2024-11-19 22:32:02,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:02,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564736280] [2024-11-19 22:32:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:02,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:03,204 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-19 22:32:03,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:03,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564736280] [2024-11-19 22:32:03,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564736280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:03,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:03,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:32:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670057171] [2024-11-19 22:32:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:03,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:32:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:03,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:32:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:32:03,208 INFO L87 Difference]: Start difference. First operand 296 states and 432 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-19 22:32:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:03,250 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2024-11-19 22:32:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:32:03,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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 92 [2024-11-19 22:32:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:03,252 INFO L225 Difference]: With dead ends: 304 [2024-11-19 22:32:03,253 INFO L226 Difference]: Without dead ends: 302 [2024-11-19 22:32:03,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:32:03,254 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:03,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1114 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:32:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-19 22:32:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-11-19 22:32:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.451827242524917) internal successors, (437), 301 states have internal predecessors, (437), 0 states have call successors, (0), 0 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-19 22:32:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 437 transitions. [2024-11-19 22:32:03,262 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 437 transitions. Word has length 92 [2024-11-19 22:32:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:03,263 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 437 transitions. [2024-11-19 22:32:03,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 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-19 22:32:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 437 transitions. [2024-11-19 22:32:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:32:03,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:03,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:03,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:32:03,265 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:03,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash 759003703, now seen corresponding path program 1 times [2024-11-19 22:32:03,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:03,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470518211] [2024-11-19 22:32:03,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:03,376 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-19 22:32:03,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470518211] [2024-11-19 22:32:03,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470518211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:03,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:03,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:32:03,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027465293] [2024-11-19 22:32:03,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:03,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:32:03,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:32:03,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:03,378 INFO L87 Difference]: Start difference. First operand 302 states and 437 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-19 22:32:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:03,407 INFO L93 Difference]: Finished difference Result 756 states and 1149 transitions. [2024-11-19 22:32:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:32:03,408 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-19 22:32:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:03,411 INFO L225 Difference]: With dead ends: 756 [2024-11-19 22:32:03,411 INFO L226 Difference]: Without dead ends: 521 [2024-11-19 22:32:03,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:03,415 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 88 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:03,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 349 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:32:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-19 22:32:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2024-11-19 22:32:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.494208494208494) internal successors, (774), 518 states have internal predecessors, (774), 0 states have call successors, (0), 0 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-19 22:32:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 774 transitions. [2024-11-19 22:32:03,431 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 774 transitions. Word has length 93 [2024-11-19 22:32:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:03,433 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 774 transitions. [2024-11-19 22:32:03,433 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-19 22:32:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 774 transitions. [2024-11-19 22:32:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:32:03,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:03,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:03,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:32:03,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:03,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1593894089, now seen corresponding path program 1 times [2024-11-19 22:32:03,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:03,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546788667] [2024-11-19 22:32:03,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:03,547 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-19 22:32:03,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546788667] [2024-11-19 22:32:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546788667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:03,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:03,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:32:03,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526370920] [2024-11-19 22:32:03,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:03,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:32:03,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:03,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:32:03,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:03,549 INFO L87 Difference]: Start difference. First operand 519 states and 774 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-19 22:32:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:03,574 INFO L93 Difference]: Finished difference Result 1391 states and 2132 transitions. [2024-11-19 22:32:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:32:03,575 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-19 22:32:03,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:03,579 INFO L225 Difference]: With dead ends: 1391 [2024-11-19 22:32:03,579 INFO L226 Difference]: Without dead ends: 939 [2024-11-19 22:32:03,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:03,580 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 86 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:03,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 351 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:32:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-11-19 22:32:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 937. [2024-11-19 22:32:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 1.5128205128205128) internal successors, (1416), 936 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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-19 22:32:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1416 transitions. [2024-11-19 22:32:03,603 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1416 transitions. Word has length 93 [2024-11-19 22:32:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:03,603 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1416 transitions. [2024-11-19 22:32:03,603 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-19 22:32:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1416 transitions. [2024-11-19 22:32:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:32:03,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:03,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:03,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:32:03,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:03,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1430979529, now seen corresponding path program 1 times [2024-11-19 22:32:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:03,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575250228] [2024-11-19 22:32:03,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:03,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:03,698 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-19 22:32:03,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:03,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575250228] [2024-11-19 22:32:03,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575250228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:03,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:03,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:32:03,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456351563] [2024-11-19 22:32:03,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:03,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:32:03,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:03,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:32:03,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:03,702 INFO L87 Difference]: Start difference. First operand 937 states and 1416 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-19 22:32:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:03,741 INFO L93 Difference]: Finished difference Result 2613 states and 4002 transitions. [2024-11-19 22:32:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:32:03,745 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-19 22:32:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:03,752 INFO L225 Difference]: With dead ends: 2613 [2024-11-19 22:32:03,752 INFO L226 Difference]: Without dead ends: 1743 [2024-11-19 22:32:03,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:03,754 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 84 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:03,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:32:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2024-11-19 22:32:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1741. [2024-11-19 22:32:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1740 states have (on average 1.5149425287356322) internal successors, (2636), 1740 states have internal predecessors, (2636), 0 states have call successors, (0), 0 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-19 22:32:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2636 transitions. [2024-11-19 22:32:03,798 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2636 transitions. Word has length 93 [2024-11-19 22:32:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:03,798 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 2636 transitions. [2024-11-19 22:32:03,798 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-19 22:32:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2636 transitions. [2024-11-19 22:32:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:32:03,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:03,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:03,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:32:03,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:03,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1167123145, now seen corresponding path program 1 times [2024-11-19 22:32:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:03,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598649534] [2024-11-19 22:32:03,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:03,885 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-19 22:32:03,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598649534] [2024-11-19 22:32:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598649534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:03,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:03,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:32:03,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542068762] [2024-11-19 22:32:03,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:03,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:32:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:03,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:32:03,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:03,888 INFO L87 Difference]: Start difference. First operand 1741 states and 2636 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-19 22:32:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:03,969 INFO L93 Difference]: Finished difference Result 4961 states and 7550 transitions. [2024-11-19 22:32:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:32:03,970 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-19 22:32:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:03,980 INFO L225 Difference]: With dead ends: 4961 [2024-11-19 22:32:03,981 INFO L226 Difference]: Without dead ends: 3287 [2024-11-19 22:32:03,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:03,983 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 82 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:03,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:32:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2024-11-19 22:32:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 3285. [2024-11-19 22:32:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3285 states, 3284 states have (on average 1.5066991473812423) internal successors, (4948), 3284 states have internal predecessors, (4948), 0 states have call successors, (0), 0 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-19 22:32:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 4948 transitions. [2024-11-19 22:32:04,070 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 4948 transitions. Word has length 93 [2024-11-19 22:32:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:04,071 INFO L471 AbstractCegarLoop]: Abstraction has 3285 states and 4948 transitions. [2024-11-19 22:32:04,071 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-19 22:32:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 4948 transitions. [2024-11-19 22:32:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:32:04,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:04,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:04,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:32:04,072 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:04,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:04,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2144329929, now seen corresponding path program 1 times [2024-11-19 22:32:04,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:04,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787517710] [2024-11-19 22:32:04,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:04,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:04,161 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-19 22:32:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:04,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787517710] [2024-11-19 22:32:04,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787517710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:04,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:04,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:32:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196409514] [2024-11-19 22:32:04,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:04,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:32:04,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:04,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:32:04,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:04,164 INFO L87 Difference]: Start difference. First operand 3285 states and 4948 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-19 22:32:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:04,257 INFO L93 Difference]: Finished difference Result 9465 states and 14262 transitions. [2024-11-19 22:32:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:32:04,257 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-19 22:32:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:04,281 INFO L225 Difference]: With dead ends: 9465 [2024-11-19 22:32:04,282 INFO L226 Difference]: Without dead ends: 6247 [2024-11-19 22:32:04,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:04,291 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 78 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:04,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 351 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:32:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6247 states. [2024-11-19 22:32:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6247 to 6245. [2024-11-19 22:32:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6245 states, 6244 states have (on average 1.4919923126201153) internal successors, (9316), 6244 states have internal predecessors, (9316), 0 states have call successors, (0), 0 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-19 22:32:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6245 states to 6245 states and 9316 transitions. [2024-11-19 22:32:04,526 INFO L78 Accepts]: Start accepts. Automaton has 6245 states and 9316 transitions. Word has length 93 [2024-11-19 22:32:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:04,526 INFO L471 AbstractCegarLoop]: Abstraction has 6245 states and 9316 transitions. [2024-11-19 22:32:04,527 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-19 22:32:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 6245 states and 9316 transitions. [2024-11-19 22:32:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:32:04,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:04,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:04,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:32:04,528 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:04,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:04,529 INFO L85 PathProgramCache]: Analyzing trace with hash -363397065, now seen corresponding path program 1 times [2024-11-19 22:32:04,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:04,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763513486] [2024-11-19 22:32:04,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:04,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:04,617 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-19 22:32:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763513486] [2024-11-19 22:32:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763513486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:04,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:04,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:32:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629506038] [2024-11-19 22:32:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:04,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:32:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:04,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:32:04,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:04,619 INFO L87 Difference]: Start difference. First operand 6245 states and 9316 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-19 22:32:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:04,820 INFO L93 Difference]: Finished difference Result 18089 states and 26918 transitions. [2024-11-19 22:32:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:32:04,821 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-19 22:32:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:04,863 INFO L225 Difference]: With dead ends: 18089 [2024-11-19 22:32:04,864 INFO L226 Difference]: Without dead ends: 11911 [2024-11-19 22:32:04,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:04,877 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 76 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:04,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:32:04,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11911 states. [2024-11-19 22:32:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11911 to 11909. [2024-11-19 22:32:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11909 states, 11908 states have (on average 1.472959355055425) internal successors, (17540), 11908 states have internal predecessors, (17540), 0 states have call successors, (0), 0 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-19 22:32:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11909 states to 11909 states and 17540 transitions. [2024-11-19 22:32:05,284 INFO L78 Accepts]: Start accepts. Automaton has 11909 states and 17540 transitions. Word has length 93 [2024-11-19 22:32:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:05,285 INFO L471 AbstractCegarLoop]: Abstraction has 11909 states and 17540 transitions. [2024-11-19 22:32:05,285 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-19 22:32:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 11909 states and 17540 transitions. [2024-11-19 22:32:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:32:05,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:05,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:05,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:32:05,286 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash 71138871, now seen corresponding path program 1 times [2024-11-19 22:32:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496862992] [2024-11-19 22:32:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:05,364 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-19 22:32:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496862992] [2024-11-19 22:32:05,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496862992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:05,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:05,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:32:05,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904444349] [2024-11-19 22:32:05,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:05,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:32:05,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:05,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:32:05,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:05,366 INFO L87 Difference]: Start difference. First operand 11909 states and 17540 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-19 22:32:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:05,733 INFO L93 Difference]: Finished difference Result 34569 states and 50694 transitions. [2024-11-19 22:32:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:32:05,734 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-19 22:32:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:05,794 INFO L225 Difference]: With dead ends: 34569 [2024-11-19 22:32:05,795 INFO L226 Difference]: Without dead ends: 22727 [2024-11-19 22:32:05,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:05,814 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 80 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:05,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 357 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:32:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22727 states. [2024-11-19 22:32:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22727 to 22725. [2024-11-19 22:32:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22725 states, 22724 states have (on average 1.4506248899841576) internal successors, (32964), 22724 states have internal predecessors, (32964), 0 states have call successors, (0), 0 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-19 22:32:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 32964 transitions. [2024-11-19 22:32:06,557 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 32964 transitions. Word has length 93 [2024-11-19 22:32:06,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:06,558 INFO L471 AbstractCegarLoop]: Abstraction has 22725 states and 32964 transitions. [2024-11-19 22:32:06,559 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-19 22:32:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 32964 transitions. [2024-11-19 22:32:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:32:06,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:06,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:32:06,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 22:32:06,561 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:06,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:06,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1748186322, now seen corresponding path program 1 times [2024-11-19 22:32:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:06,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003108573] [2024-11-19 22:32:06,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:06,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:06,665 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-19 22:32:06,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:06,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003108573] [2024-11-19 22:32:06,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003108573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:06,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:06,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:32:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446314347] [2024-11-19 22:32:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:06,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:32:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:06,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:32:06,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:06,668 INFO L87 Difference]: Start difference. First operand 22725 states and 32964 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-19 22:32:07,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:07,324 INFO L93 Difference]: Finished difference Result 46284 states and 67530 transitions. [2024-11-19 22:32:07,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:32:07,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-19 22:32:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:07,397 INFO L225 Difference]: With dead ends: 46284 [2024-11-19 22:32:07,397 INFO L226 Difference]: Without dead ends: 33737 [2024-11-19 22:32:07,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:32:07,422 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 87 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:07,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:32:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33737 states. [2024-11-19 22:32:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33737 to 33735. [2024-11-19 22:32:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33735 states, 33734 states have (on average 1.4439437955771626) internal successors, (48710), 33734 states have internal predecessors, (48710), 0 states have call successors, (0), 0 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-19 22:32:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33735 states to 33735 states and 48710 transitions. [2024-11-19 22:32:08,481 INFO L78 Accepts]: Start accepts. Automaton has 33735 states and 48710 transitions. Word has length 95 [2024-11-19 22:32:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:08,482 INFO L471 AbstractCegarLoop]: Abstraction has 33735 states and 48710 transitions. [2024-11-19 22:32:08,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-19 22:32:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 33735 states and 48710 transitions. [2024-11-19 22:32:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 22:32:08,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:08,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:32:08,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:32:08,492 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:08,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash -467827745, now seen corresponding path program 1 times [2024-11-19 22:32:08,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:08,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842031949] [2024-11-19 22:32:08,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:08,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:32:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:08,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842031949] [2024-11-19 22:32:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842031949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:08,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:08,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:32:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205122808] [2024-11-19 22:32:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:08,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 22:32:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 22:32:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:32:08,858 INFO L87 Difference]: Start difference. First operand 33735 states and 48710 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:32:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:12,689 INFO L93 Difference]: Finished difference Result 309849 states and 447311 transitions. [2024-11-19 22:32:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 22:32:12,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-11-19 22:32:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:13,698 INFO L225 Difference]: With dead ends: 309849 [2024-11-19 22:32:13,699 INFO L226 Difference]: Without dead ends: 276183 [2024-11-19 22:32:13,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:32:13,834 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 1681 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:13,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 2311 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:32:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276183 states. [2024-11-19 22:32:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276183 to 67399. [2024-11-19 22:32:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67399 states, 67398 states have (on average 1.4387073800409507) internal successors, (96966), 67398 states have internal predecessors, (96966), 0 states have call successors, (0), 0 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-19 22:32:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67399 states to 67399 states and 96966 transitions. [2024-11-19 22:32:17,891 INFO L78 Accepts]: Start accepts. Automaton has 67399 states and 96966 transitions. Word has length 118 [2024-11-19 22:32:17,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:17,892 INFO L471 AbstractCegarLoop]: Abstraction has 67399 states and 96966 transitions. [2024-11-19 22:32:17,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:32:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 67399 states and 96966 transitions. [2024-11-19 22:32:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 22:32:17,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:17,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:32:17,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:32:17,902 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:17,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1474241759, now seen corresponding path program 1 times [2024-11-19 22:32:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533788845] [2024-11-19 22:32:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 22:32:18,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:18,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533788845] [2024-11-19 22:32:18,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533788845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:18,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:18,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:32:18,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098332333] [2024-11-19 22:32:18,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:18,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 22:32:18,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:18,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 22:32:18,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:32:18,226 INFO L87 Difference]: Start difference. First operand 67399 states and 96966 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-19 22:32:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:23,355 INFO L93 Difference]: Finished difference Result 343513 states and 495567 transitions. [2024-11-19 22:32:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 22:32:23,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 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 118 [2024-11-19 22:32:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:23,991 INFO L225 Difference]: With dead ends: 343513 [2024-11-19 22:32:23,991 INFO L226 Difference]: Without dead ends: 309847 [2024-11-19 22:32:24,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:32:24,086 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 1706 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:24,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 2144 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:32:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309847 states. [2024-11-19 22:32:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309847 to 117959. [2024-11-19 22:32:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117959 states, 117958 states have (on average 1.4329676664575526) internal successors, (169030), 117958 states have internal predecessors, (169030), 0 states have call successors, (0), 0 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-19 22:32:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117959 states to 117959 states and 169030 transitions. [2024-11-19 22:32:28,981 INFO L78 Accepts]: Start accepts. Automaton has 117959 states and 169030 transitions. Word has length 118 [2024-11-19 22:32:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:28,982 INFO L471 AbstractCegarLoop]: Abstraction has 117959 states and 169030 transitions. [2024-11-19 22:32:28,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-19 22:32:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 117959 states and 169030 transitions. [2024-11-19 22:32:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 22:32:28,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:28,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:32:28,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:32:28,993 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:28,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1637156319, now seen corresponding path program 1 times [2024-11-19 22:32:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554030090] [2024-11-19 22:32:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 22:32:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:29,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554030090] [2024-11-19 22:32:29,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554030090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:29,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:29,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:32:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740954246] [2024-11-19 22:32:29,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:29,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 22:32:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:29,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 22:32:29,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:32:29,304 INFO L87 Difference]: Start difference. First operand 117959 states and 169030 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:32:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:35,790 INFO L93 Difference]: Finished difference Result 377177 states and 543823 transitions. [2024-11-19 22:32:35,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 22:32:35,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-11-19 22:32:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:36,592 INFO L225 Difference]: With dead ends: 377177 [2024-11-19 22:32:36,592 INFO L226 Difference]: Without dead ends: 343511 [2024-11-19 22:32:36,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:32:36,722 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1747 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:36,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 2041 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:32:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343511 states. [2024-11-19 22:32:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343511 to 151623. [2024-11-19 22:32:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151623 states, 151622 states have (on average 1.433076994103758) internal successors, (217286), 151622 states have internal predecessors, (217286), 0 states have call successors, (0), 0 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-19 22:32:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151623 states to 151623 states and 217286 transitions. [2024-11-19 22:32:42,790 INFO L78 Accepts]: Start accepts. Automaton has 151623 states and 217286 transitions. Word has length 118 [2024-11-19 22:32:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:32:42,791 INFO L471 AbstractCegarLoop]: Abstraction has 151623 states and 217286 transitions. [2024-11-19 22:32:42,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:32:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 151623 states and 217286 transitions. [2024-11-19 22:32:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 22:32:42,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:32:42,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:32:42,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 22:32:42,805 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:32:42,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:32:42,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1901012703, now seen corresponding path program 1 times [2024-11-19 22:32:42,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:32:42,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721596241] [2024-11-19 22:32:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:32:42,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:32:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:32:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 22:32:43,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:32:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721596241] [2024-11-19 22:32:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721596241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:32:43,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:32:43,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:32:43,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055700950] [2024-11-19 22:32:43,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:32:43,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 22:32:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:32:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 22:32:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:32:43,066 INFO L87 Difference]: Start difference. First operand 151623 states and 217286 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:32:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:32:50,529 INFO L93 Difference]: Finished difference Result 410841 states and 592079 transitions. [2024-11-19 22:32:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 22:32:50,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-11-19 22:32:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:32:51,245 INFO L225 Difference]: With dead ends: 410841 [2024-11-19 22:32:51,245 INFO L226 Difference]: Without dead ends: 377175 [2024-11-19 22:32:51,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:32:51,337 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 1901 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:32:51,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 1969 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:32:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377175 states.