./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.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.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 52f795f47ad9dd0b1b0499f649b5f623fed211e53433ed6d87534c63dbfae98b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:32:25,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:32:25,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:32:25,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:32:25,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:32:25,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:32:25,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:32:25,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:32:25,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:32:25,312 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:32:25,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:32:25,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:32:25,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:32:25,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:32:25,315 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:32:25,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:32:25,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:32:25,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:32:25,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:32:25,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:32:25,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:32:25,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:32:25,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:32:25,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:32:25,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:32:25,321 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:32:25,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:32:25,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:32:25,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:32:25,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:32:25,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:32:25,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:32:25,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:32:25,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:32:25,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:32:25,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:32:25,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:32:25,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:32:25,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:32:25,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:32:25,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:32:25,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:32:25,326 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 -> 52f795f47ad9dd0b1b0499f649b5f623fed211e53433ed6d87534c63dbfae98b [2024-10-14 03:32:25,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:32:25,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:32:25,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:32:25,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:32:25,608 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:32:25,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c [2024-10-14 03:32:27,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:32:27,278 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:32:27,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c [2024-10-14 03:32:27,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692e1ec05/8c73c9199ccc4545ad8bcd4f13d3d185/FLAG49f839e47 [2024-10-14 03:32:27,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692e1ec05/8c73c9199ccc4545ad8bcd4f13d3d185 [2024-10-14 03:32:27,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:32:27,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:32:27,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:32:27,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:32:27,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:32:27,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd11df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27, skipping insertion in model container [2024-10-14 03:32:27,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:32:27,588 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c[8305,8318] [2024-10-14 03:32:27,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:32:27,611 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:32:27,666 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c[8305,8318] [2024-10-14 03:32:27,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:32:27,685 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:32:27,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27 WrapperNode [2024-10-14 03:32:27,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:32:27,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:32:27,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:32:27,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:32:27,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,733 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 278 [2024-10-14 03:32:27,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:32:27,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:32:27,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:32:27,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:32:27,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,766 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:32:27,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:32:27,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:32:27,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:32:27,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:32:27,809 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (1/1) ... [2024-10-14 03:32:27,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:32:27,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:27,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:32:27,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:32:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:32:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:32:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:32:27,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:32:27,972 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:32:27,975 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:32:28,372 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-14 03:32:28,372 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:32:28,419 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:32:28,420 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:32:28,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:32:28 BoogieIcfgContainer [2024-10-14 03:32:28,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:32:28,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:32:28,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:32:28,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:32:28,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:32:27" (1/3) ... [2024-10-14 03:32:28,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769dcfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:32:28, skipping insertion in model container [2024-10-14 03:32:28,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:32:27" (2/3) ... [2024-10-14 03:32:28,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769dcfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:32:28, skipping insertion in model container [2024-10-14 03:32:28,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:32:28" (3/3) ... [2024-10-14 03:32:28,451 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c [2024-10-14 03:32:28,465 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:32:28,465 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:32:28,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:32:28,547 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;@647d0cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:32:28,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:32:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.78125) internal successors, (114), 65 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 03:32:28,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:28,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:28,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:28,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash -477272920, now seen corresponding path program 1 times [2024-10-14 03:32:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:28,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923808234] [2024-10-14 03:32:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:28,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:28,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923808234] [2024-10-14 03:32:28,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923808234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:28,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:28,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:32:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510657883] [2024-10-14 03:32:28,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:28,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:32:28,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:28,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:32:28,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:32:28,851 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.78125) internal successors, (114), 65 states have internal predecessors, (114), 0 states have call successors, (0), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:28,881 INFO L93 Difference]: Finished difference Result 104 states and 177 transitions. [2024-10-14 03:32:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:32:28,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-14 03:32:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:28,894 INFO L225 Difference]: With dead ends: 104 [2024-10-14 03:32:28,894 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 03:32:28,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:32:28,903 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:28,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 03:32:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 03:32:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 63 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2024-10-14 03:32:28,935 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 18 [2024-10-14 03:32:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:28,936 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2024-10-14 03:32:28,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2024-10-14 03:32:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 03:32:28,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:28,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:28,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:32:28,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:28,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1757136598, now seen corresponding path program 1 times [2024-10-14 03:32:28,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:28,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189685559] [2024-10-14 03:32:28,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:28,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:29,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:29,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189685559] [2024-10-14 03:32:29,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189685559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:29,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:29,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:32:29,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104222268] [2024-10-14 03:32:29,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:29,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:32:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:32:29,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:32:29,118 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:29,193 INFO L93 Difference]: Finished difference Result 104 states and 171 transitions. [2024-10-14 03:32:29,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:32:29,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-14 03:32:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:29,195 INFO L225 Difference]: With dead ends: 104 [2024-10-14 03:32:29,195 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 03:32:29,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:32:29,197 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:29,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:32:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 03:32:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 03:32:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2024-10-14 03:32:29,204 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 18 [2024-10-14 03:32:29,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:29,205 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2024-10-14 03:32:29,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2024-10-14 03:32:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 03:32:29,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:29,206 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] [2024-10-14 03:32:29,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:32:29,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:29,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash 890721989, now seen corresponding path program 1 times [2024-10-14 03:32:29,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:29,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508984051] [2024-10-14 03:32:29,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:29,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508984051] [2024-10-14 03:32:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508984051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:29,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:32:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733659266] [2024-10-14 03:32:29,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:29,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:32:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:29,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:32:29,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:32:29,418 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:29,626 INFO L93 Difference]: Finished difference Result 360 states and 558 transitions. [2024-10-14 03:32:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:32:29,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-14 03:32:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:29,629 INFO L225 Difference]: With dead ends: 360 [2024-10-14 03:32:29,629 INFO L226 Difference]: Without dead ends: 323 [2024-10-14 03:32:29,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:32:29,634 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 563 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:29,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 630 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:32:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-14 03:32:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 99. [2024-10-14 03:32:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 98 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2024-10-14 03:32:29,654 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 40 [2024-10-14 03:32:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:29,655 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2024-10-14 03:32:29,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2024-10-14 03:32:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 03:32:29,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:29,657 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] [2024-10-14 03:32:29,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:32:29,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:29,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash 525634581, now seen corresponding path program 1 times [2024-10-14 03:32:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:29,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727604918] [2024-10-14 03:32:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:29,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727604918] [2024-10-14 03:32:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727604918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:29,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:29,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:29,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196495588] [2024-10-14 03:32:29,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:29,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:29,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:29,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:29,777 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:29,830 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2024-10-14 03:32:29,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:29,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-14 03:32:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:29,832 INFO L225 Difference]: With dead ends: 232 [2024-10-14 03:32:29,832 INFO L226 Difference]: Without dead ends: 160 [2024-10-14 03:32:29,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:29,834 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:29,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 130 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-14 03:32:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2024-10-14 03:32:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4838709677419355) internal successors, (230), 155 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 230 transitions. [2024-10-14 03:32:29,871 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 230 transitions. Word has length 42 [2024-10-14 03:32:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:29,872 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 230 transitions. [2024-10-14 03:32:29,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 230 transitions. [2024-10-14 03:32:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 03:32:29,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:29,873 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] [2024-10-14 03:32:29,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:32:29,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:29,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash 527779533, now seen corresponding path program 1 times [2024-10-14 03:32:29,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:29,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505679897] [2024-10-14 03:32:29,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:29,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:30,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:30,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505679897] [2024-10-14 03:32:30,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505679897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:30,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:30,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:32:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845769169] [2024-10-14 03:32:30,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:30,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:32:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:30,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:32:30,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:32:30,144 INFO L87 Difference]: Start difference. First operand 156 states and 230 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:30,268 INFO L93 Difference]: Finished difference Result 287 states and 434 transitions. [2024-10-14 03:32:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:32:30,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-14 03:32:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:30,271 INFO L225 Difference]: With dead ends: 287 [2024-10-14 03:32:30,271 INFO L226 Difference]: Without dead ends: 158 [2024-10-14 03:32:30,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:32:30,274 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 176 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:30,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 239 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:32:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-14 03:32:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2024-10-14 03:32:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 155 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-10-14 03:32:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions. [2024-10-14 03:32:30,290 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 228 transitions. Word has length 42 [2024-10-14 03:32:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:30,291 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 228 transitions. [2024-10-14 03:32:30,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 228 transitions. [2024-10-14 03:32:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 03:32:30,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:30,293 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] [2024-10-14 03:32:30,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:32:30,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:30,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash -832747470, now seen corresponding path program 1 times [2024-10-14 03:32:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:30,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087428432] [2024-10-14 03:32:30,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:30,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:30,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087428432] [2024-10-14 03:32:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087428432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:30,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:32:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347797302] [2024-10-14 03:32:30,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:30,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:32:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:30,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:32:30,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:32:30,446 INFO L87 Difference]: Start difference. First operand 156 states and 228 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:30,471 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2024-10-14 03:32:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:32:30,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-14 03:32:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:30,473 INFO L225 Difference]: With dead ends: 162 [2024-10-14 03:32:30,473 INFO L226 Difference]: Without dead ends: 160 [2024-10-14 03:32:30,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:32:30,477 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:30,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:30,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-14 03:32:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-14 03:32:30,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.4528301886792452) internal successors, (231), 159 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 231 transitions. [2024-10-14 03:32:30,495 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 231 transitions. Word has length 43 [2024-10-14 03:32:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:30,496 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 231 transitions. [2024-10-14 03:32:30,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 231 transitions. [2024-10-14 03:32:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 03:32:30,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:30,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:30,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:32:30,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:30,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1232457331, now seen corresponding path program 1 times [2024-10-14 03:32:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:30,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133722679] [2024-10-14 03:32:30,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:30,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:30,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:30,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133722679] [2024-10-14 03:32:30,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133722679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:30,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:30,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:30,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921891117] [2024-10-14 03:32:30,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:30,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:30,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:30,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:30,585 INFO L87 Difference]: Start difference. First operand 160 states and 231 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:30,609 INFO L93 Difference]: Finished difference Result 410 states and 611 transitions. [2024-10-14 03:32:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-14 03:32:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:30,612 INFO L225 Difference]: With dead ends: 410 [2024-10-14 03:32:30,612 INFO L226 Difference]: Without dead ends: 277 [2024-10-14 03:32:30,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:30,615 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:30,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-14 03:32:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2024-10-14 03:32:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.467153284671533) internal successors, (402), 274 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 402 transitions. [2024-10-14 03:32:30,632 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 402 transitions. Word has length 44 [2024-10-14 03:32:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:30,632 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 402 transitions. [2024-10-14 03:32:30,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 402 transitions. [2024-10-14 03:32:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 03:32:30,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:30,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:30,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:32:30,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:30,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash -969379955, now seen corresponding path program 1 times [2024-10-14 03:32:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:30,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259227419] [2024-10-14 03:32:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:30,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:30,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:30,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259227419] [2024-10-14 03:32:30,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259227419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:30,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14618859] [2024-10-14 03:32:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:30,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:30,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:30,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:30,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:30,708 INFO L87 Difference]: Start difference. First operand 275 states and 402 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:30,742 INFO L93 Difference]: Finished difference Result 739 states and 1096 transitions. [2024-10-14 03:32:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:30,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-14 03:32:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:30,745 INFO L225 Difference]: With dead ends: 739 [2024-10-14 03:32:30,746 INFO L226 Difference]: Without dead ends: 491 [2024-10-14 03:32:30,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:30,747 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 43 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:30,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 177 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-14 03:32:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2024-10-14 03:32:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.459016393442623) internal successors, (712), 488 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 712 transitions. [2024-10-14 03:32:30,776 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 712 transitions. Word has length 44 [2024-10-14 03:32:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:30,776 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 712 transitions. [2024-10-14 03:32:30,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 712 transitions. [2024-10-14 03:32:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 03:32:30,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:30,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:30,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:32:30,778 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:30,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:30,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1858113395, now seen corresponding path program 1 times [2024-10-14 03:32:30,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:30,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172049159] [2024-10-14 03:32:30,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:30,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:30,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:30,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172049159] [2024-10-14 03:32:30,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172049159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:30,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:30,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:30,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120380938] [2024-10-14 03:32:30,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:30,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:30,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:30,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:30,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:30,837 INFO L87 Difference]: Start difference. First operand 489 states and 712 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:30,877 INFO L93 Difference]: Finished difference Result 1349 states and 1970 transitions. [2024-10-14 03:32:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:30,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-14 03:32:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:30,882 INFO L225 Difference]: With dead ends: 1349 [2024-10-14 03:32:30,882 INFO L226 Difference]: Without dead ends: 887 [2024-10-14 03:32:30,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:30,885 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 45 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:30,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 183 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-10-14 03:32:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2024-10-14 03:32:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.4343891402714932) internal successors, (1268), 884 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1268 transitions. [2024-10-14 03:32:30,921 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1268 transitions. Word has length 44 [2024-10-14 03:32:30,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:30,922 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1268 transitions. [2024-10-14 03:32:30,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:30,922 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1268 transitions. [2024-10-14 03:32:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 03:32:30,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:30,923 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] [2024-10-14 03:32:30,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:32:30,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:30,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:30,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2078681774, now seen corresponding path program 1 times [2024-10-14 03:32:30,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:30,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389882771] [2024-10-14 03:32:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:30,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:30,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389882771] [2024-10-14 03:32:30,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389882771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:30,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:30,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:30,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518885298] [2024-10-14 03:32:30,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:30,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:30,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:30,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:30,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:30,982 INFO L87 Difference]: Start difference. First operand 885 states and 1268 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:31,025 INFO L93 Difference]: Finished difference Result 1788 states and 2602 transitions. [2024-10-14 03:32:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:31,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-14 03:32:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:31,031 INFO L225 Difference]: With dead ends: 1788 [2024-10-14 03:32:31,031 INFO L226 Difference]: Without dead ends: 1289 [2024-10-14 03:32:31,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:31,032 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:31,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 182 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-10-14 03:32:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1287. [2024-10-14 03:32:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1286 states have (on average 1.4292379471228616) internal successors, (1838), 1286 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1838 transitions. [2024-10-14 03:32:31,076 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1838 transitions. Word has length 46 [2024-10-14 03:32:31,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:31,076 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1838 transitions. [2024-10-14 03:32:31,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1838 transitions. [2024-10-14 03:32:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 03:32:31,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:31,078 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:31,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:32:31,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:31,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:31,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1699388060, now seen corresponding path program 1 times [2024-10-14 03:32:31,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:31,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204975292] [2024-10-14 03:32:31,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:31,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:32:31,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:31,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204975292] [2024-10-14 03:32:31,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204975292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:31,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:31,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:32:31,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334149987] [2024-10-14 03:32:31,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:31,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:32:31,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:31,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:32:31,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:32:31,248 INFO L87 Difference]: Start difference. First operand 1287 states and 1838 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:31,464 INFO L93 Difference]: Finished difference Result 6593 states and 9451 transitions. [2024-10-14 03:32:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:32:31,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 60 [2024-10-14 03:32:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:31,485 INFO L225 Difference]: With dead ends: 6593 [2024-10-14 03:32:31,485 INFO L226 Difference]: Without dead ends: 5335 [2024-10-14 03:32:31,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:32:31,490 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 379 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:31,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 431 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:32:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5335 states. [2024-10-14 03:32:31,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5335 to 2543. [2024-10-14 03:32:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2542 states have (on average 1.4248623131392604) internal successors, (3622), 2542 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3622 transitions. [2024-10-14 03:32:31,623 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3622 transitions. Word has length 60 [2024-10-14 03:32:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:31,624 INFO L471 AbstractCegarLoop]: Abstraction has 2543 states and 3622 transitions. [2024-10-14 03:32:31,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3622 transitions. [2024-10-14 03:32:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 03:32:31,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:31,625 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:31,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:32:31,625 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:31,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:31,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1962465436, now seen corresponding path program 1 times [2024-10-14 03:32:31,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:31,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731999401] [2024-10-14 03:32:31,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:31,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:32:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731999401] [2024-10-14 03:32:31,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731999401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:31,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:31,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:32:31,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54312023] [2024-10-14 03:32:31,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:31,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:32:31,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:31,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:32:31,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:32:31,758 INFO L87 Difference]: Start difference. First operand 2543 states and 3622 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:32,049 INFO L93 Difference]: Finished difference Result 7849 states and 11235 transitions. [2024-10-14 03:32:32,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:32:32,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 60 [2024-10-14 03:32:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:32,075 INFO L225 Difference]: With dead ends: 7849 [2024-10-14 03:32:32,076 INFO L226 Difference]: Without dead ends: 6591 [2024-10-14 03:32:32,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:32:32,083 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 371 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:32,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 422 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:32:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2024-10-14 03:32:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 4431. [2024-10-14 03:32:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 4430 states have (on average 1.4171557562076749) internal successors, (6278), 4430 states have internal predecessors, (6278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 6278 transitions. [2024-10-14 03:32:32,289 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 6278 transitions. Word has length 60 [2024-10-14 03:32:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:32,290 INFO L471 AbstractCegarLoop]: Abstraction has 4431 states and 6278 transitions. [2024-10-14 03:32:32,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 6278 transitions. [2024-10-14 03:32:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 03:32:32,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:32,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:32,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:32:32,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:32,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:32,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1073731996, now seen corresponding path program 1 times [2024-10-14 03:32:32,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:32,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289059773] [2024-10-14 03:32:32,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:32,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:32:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:32,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289059773] [2024-10-14 03:32:32,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289059773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:32,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:32,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:32:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982234738] [2024-10-14 03:32:32,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:32,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:32:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:32,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:32:32,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:32:32,411 INFO L87 Difference]: Start difference. First operand 4431 states and 6278 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:32,679 INFO L93 Difference]: Finished difference Result 9105 states and 13019 transitions. [2024-10-14 03:32:32,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:32:32,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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 60 [2024-10-14 03:32:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:32,707 INFO L225 Difference]: With dead ends: 9105 [2024-10-14 03:32:32,707 INFO L226 Difference]: Without dead ends: 7847 [2024-10-14 03:32:32,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:32:32,713 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 347 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:32,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 441 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:32:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7847 states. [2024-10-14 03:32:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7847 to 5687. [2024-10-14 03:32:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5687 states, 5686 states have (on average 1.4178684488216673) internal successors, (8062), 5686 states have internal predecessors, (8062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5687 states to 5687 states and 8062 transitions. [2024-10-14 03:32:32,987 INFO L78 Accepts]: Start accepts. Automaton has 5687 states and 8062 transitions. Word has length 60 [2024-10-14 03:32:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:32,987 INFO L471 AbstractCegarLoop]: Abstraction has 5687 states and 8062 transitions. [2024-10-14 03:32:32,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5687 states and 8062 transitions. [2024-10-14 03:32:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 03:32:32,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:32,989 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:32,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:32:32,990 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:32,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:32,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2073807199, now seen corresponding path program 1 times [2024-10-14 03:32:32,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:32,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388130783] [2024-10-14 03:32:32,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:32,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:32:33,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:33,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388130783] [2024-10-14 03:32:33,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388130783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:33,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:33,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:32:33,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705637147] [2024-10-14 03:32:33,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:33,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:32:33,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:33,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:32:33,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:32:33,111 INFO L87 Difference]: Start difference. First operand 5687 states and 8062 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:33,425 INFO L93 Difference]: Finished difference Result 9641 states and 13811 transitions. [2024-10-14 03:32:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:32:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 62 [2024-10-14 03:32:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:33,450 INFO L225 Difference]: With dead ends: 9641 [2024-10-14 03:32:33,450 INFO L226 Difference]: Without dead ends: 8743 [2024-10-14 03:32:33,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:32:33,454 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 374 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:33,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 478 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:32:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2024-10-14 03:32:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 6583. [2024-10-14 03:32:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6583 states, 6582 states have (on average 1.4217563050744455) internal successors, (9358), 6582 states have internal predecessors, (9358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6583 states to 6583 states and 9358 transitions. [2024-10-14 03:32:33,736 INFO L78 Accepts]: Start accepts. Automaton has 6583 states and 9358 transitions. Word has length 62 [2024-10-14 03:32:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:33,736 INFO L471 AbstractCegarLoop]: Abstraction has 6583 states and 9358 transitions. [2024-10-14 03:32:33,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6583 states and 9358 transitions. [2024-10-14 03:32:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 03:32:33,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:33,738 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:33,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:32:33,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:33,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash 266793188, now seen corresponding path program 1 times [2024-10-14 03:32:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:33,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405220868] [2024-10-14 03:32:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:33,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:33,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405220868] [2024-10-14 03:32:33,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405220868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:33,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:33,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:33,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2675269] [2024-10-14 03:32:33,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:33,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:33,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:33,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:33,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:33,852 INFO L87 Difference]: Start difference. First operand 6583 states and 9358 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:34,000 INFO L93 Difference]: Finished difference Result 11532 states and 16506 transitions. [2024-10-14 03:32:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:34,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-14 03:32:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:34,011 INFO L225 Difference]: With dead ends: 11532 [2024-10-14 03:32:34,011 INFO L226 Difference]: Without dead ends: 4978 [2024-10-14 03:32:34,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:34,019 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 42 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:34,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 185 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2024-10-14 03:32:34,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4976. [2024-10-14 03:32:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4976 states, 4975 states have (on average 1.4245226130653266) internal successors, (7087), 4975 states have internal predecessors, (7087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4976 states to 4976 states and 7087 transitions. [2024-10-14 03:32:34,200 INFO L78 Accepts]: Start accepts. Automaton has 4976 states and 7087 transitions. Word has length 62 [2024-10-14 03:32:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:34,201 INFO L471 AbstractCegarLoop]: Abstraction has 4976 states and 7087 transitions. [2024-10-14 03:32:34,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4976 states and 7087 transitions. [2024-10-14 03:32:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:32:34,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:34,202 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:32:34,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:32:34,202 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:34,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1163729101, now seen corresponding path program 1 times [2024-10-14 03:32:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:34,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291763394] [2024-10-14 03:32:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:34,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:34,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291763394] [2024-10-14 03:32:34,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291763394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:34,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:34,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:34,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470366629] [2024-10-14 03:32:34,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:34,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:34,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:34,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:34,292 INFO L87 Difference]: Start difference. First operand 4976 states and 7087 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:34,363 INFO L93 Difference]: Finished difference Result 7444 states and 10609 transitions. [2024-10-14 03:32:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:34,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-14 03:32:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:34,370 INFO L225 Difference]: With dead ends: 7444 [2024-10-14 03:32:34,370 INFO L226 Difference]: Without dead ends: 2514 [2024-10-14 03:32:34,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:34,375 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:34,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 170 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2024-10-14 03:32:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2512. [2024-10-14 03:32:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2512 states, 2511 states have (on average 1.4030266825965751) internal successors, (3523), 2511 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 3523 transitions. [2024-10-14 03:32:34,441 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 3523 transitions. Word has length 63 [2024-10-14 03:32:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:34,441 INFO L471 AbstractCegarLoop]: Abstraction has 2512 states and 3523 transitions. [2024-10-14 03:32:34,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 3523 transitions. [2024-10-14 03:32:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:32:34,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:34,443 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:34,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:32:34,443 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:34,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2020531995, now seen corresponding path program 1 times [2024-10-14 03:32:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:34,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222491525] [2024-10-14 03:32:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:34,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:34,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222491525] [2024-10-14 03:32:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222491525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:34,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:34,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:34,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006470970] [2024-10-14 03:32:34,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:34,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:34,529 INFO L87 Difference]: Start difference. First operand 2512 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:34,586 INFO L93 Difference]: Finished difference Result 3748 states and 5263 transitions. [2024-10-14 03:32:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:34,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 03:32:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:34,590 INFO L225 Difference]: With dead ends: 3748 [2024-10-14 03:32:34,590 INFO L226 Difference]: Without dead ends: 1282 [2024-10-14 03:32:34,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:34,593 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:34,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 155 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2024-10-14 03:32:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1280. [2024-10-14 03:32:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.3784206411258797) internal successors, (1763), 1279 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1763 transitions. [2024-10-14 03:32:34,629 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1763 transitions. Word has length 65 [2024-10-14 03:32:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:34,630 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1763 transitions. [2024-10-14 03:32:34,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1763 transitions. [2024-10-14 03:32:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:32:34,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:34,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:34,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:32:34,631 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:34,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:34,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1020997353, now seen corresponding path program 1 times [2024-10-14 03:32:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733389750] [2024-10-14 03:32:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:34,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:34,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:34,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733389750] [2024-10-14 03:32:34,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733389750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:34,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751084866] [2024-10-14 03:32:34,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:34,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:34,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:34,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:34,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:34,721 INFO L87 Difference]: Start difference. First operand 1280 states and 1763 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:34,748 INFO L93 Difference]: Finished difference Result 1900 states and 2623 transitions. [2024-10-14 03:32:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:34,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-14 03:32:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:34,751 INFO L225 Difference]: With dead ends: 1900 [2024-10-14 03:32:34,751 INFO L226 Difference]: Without dead ends: 666 [2024-10-14 03:32:34,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:34,753 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:34,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 140 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-14 03:32:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2024-10-14 03:32:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.3484162895927603) internal successors, (894), 663 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 894 transitions. [2024-10-14 03:32:34,771 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 894 transitions. Word has length 67 [2024-10-14 03:32:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:34,771 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 894 transitions. [2024-10-14 03:32:34,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 894 transitions. [2024-10-14 03:32:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:32:34,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:34,772 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:34,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:32:34,773 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:34,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:34,773 INFO L85 PathProgramCache]: Analyzing trace with hash 261810231, now seen corresponding path program 1 times [2024-10-14 03:32:34,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:34,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848054918] [2024-10-14 03:32:34,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:34,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:37,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:37,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848054918] [2024-10-14 03:32:37,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848054918] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:37,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229384825] [2024-10-14 03:32:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:37,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:37,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:37,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:32:37,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:32:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:38,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 03:32:38,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:32:38,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:32:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:32:38,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229384825] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:32:38,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:32:38,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 4] total 17 [2024-10-14 03:32:38,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677135548] [2024-10-14 03:32:38,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:32:38,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 03:32:38,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:38,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 03:32:38,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:32:38,488 INFO L87 Difference]: Start difference. First operand 664 states and 894 transitions. Second operand has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:42,642 INFO L93 Difference]: Finished difference Result 5387 states and 7265 transitions. [2024-10-14 03:32:42,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-10-14 03:32:42,643 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 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 69 [2024-10-14 03:32:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:42,655 INFO L225 Difference]: With dead ends: 5387 [2024-10-14 03:32:42,655 INFO L226 Difference]: Without dead ends: 4769 [2024-10-14 03:32:42,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=828, Invalid=3594, Unknown=0, NotChecked=0, Total=4422 [2024-10-14 03:32:42,658 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 1876 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1876 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:42,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1876 Valid, 645 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 03:32:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2024-10-14 03:32:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4649. [2024-10-14 03:32:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4649 states, 4648 states have (on average 1.2872203098106711) internal successors, (5983), 4648 states have internal predecessors, (5983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 5983 transitions. [2024-10-14 03:32:42,808 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 5983 transitions. Word has length 69 [2024-10-14 03:32:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 4649 states and 5983 transitions. [2024-10-14 03:32:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 5983 transitions. [2024-10-14 03:32:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 03:32:42,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:42,809 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:32:42,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 03:32:43,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:43,010 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:43,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:43,011 INFO L85 PathProgramCache]: Analyzing trace with hash 418737613, now seen corresponding path program 1 times [2024-10-14 03:32:43,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:43,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270849278] [2024-10-14 03:32:43,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:43,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:43,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:43,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270849278] [2024-10-14 03:32:43,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270849278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456793548] [2024-10-14 03:32:43,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:43,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:43,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:43,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:32:43,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:32:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:43,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 03:32:43,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:43,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:32:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:44,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456793548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:32:44,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:32:44,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-14 03:32:44,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454177764] [2024-10-14 03:32:44,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:32:44,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 03:32:44,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:44,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 03:32:44,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:32:44,639 INFO L87 Difference]: Start difference. First operand 4649 states and 5983 transitions. Second operand has 23 states, 23 states have (on average 7.565217391304348) internal successors, (174), 22 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:46,259 INFO L93 Difference]: Finished difference Result 21246 states and 27501 transitions. [2024-10-14 03:32:46,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 03:32:46,260 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.565217391304348) internal successors, (174), 22 states have internal predecessors, (174), 0 states have call successors, (0), 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 70 [2024-10-14 03:32:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:46,288 INFO L225 Difference]: With dead ends: 21246 [2024-10-14 03:32:46,288 INFO L226 Difference]: Without dead ends: 16685 [2024-10-14 03:32:46,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=535, Invalid=2117, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 03:32:46,296 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 1400 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:46,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 842 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:32:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16685 states. [2024-10-14 03:32:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16685 to 16435. [2024-10-14 03:32:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16435 states, 16434 states have (on average 1.261835219666545) internal successors, (20737), 16434 states have internal predecessors, (20737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16435 states to 16435 states and 20737 transitions. [2024-10-14 03:32:46,942 INFO L78 Accepts]: Start accepts. Automaton has 16435 states and 20737 transitions. Word has length 70 [2024-10-14 03:32:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:46,942 INFO L471 AbstractCegarLoop]: Abstraction has 16435 states and 20737 transitions. [2024-10-14 03:32:46,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.565217391304348) internal successors, (174), 22 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 16435 states and 20737 transitions. [2024-10-14 03:32:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 03:32:46,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:46,944 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:32:46,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:32:47,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-14 03:32:47,149 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:47,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1779713587, now seen corresponding path program 1 times [2024-10-14 03:32:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:47,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386255887] [2024-10-14 03:32:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:47,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:47,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386255887] [2024-10-14 03:32:47,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386255887] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:47,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681673713] [2024-10-14 03:32:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:47,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:47,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:47,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:32:47,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:32:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:47,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 03:32:47,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:48,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:32:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681673713] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:32:48,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:32:48,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-14 03:32:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584349726] [2024-10-14 03:32:48,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:32:48,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 03:32:48,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:48,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 03:32:48,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:32:48,878 INFO L87 Difference]: Start difference. First operand 16435 states and 20737 transitions. Second operand has 20 states, 20 states have (on average 8.35) internal successors, (167), 19 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-10-14 03:32:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:49,616 INFO L93 Difference]: Finished difference Result 30760 states and 38926 transitions. [2024-10-14 03:32:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:32:49,617 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.35) internal successors, (167), 19 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) Word has length 70 [2024-10-14 03:32:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:49,649 INFO L225 Difference]: With dead ends: 30760 [2024-10-14 03:32:49,649 INFO L226 Difference]: Without dead ends: 17183 [2024-10-14 03:32:49,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:32:49,665 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 382 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:49,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 511 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:32:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17183 states. [2024-10-14 03:32:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17183 to 15731. [2024-10-14 03:32:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15731 states, 15730 states have (on average 1.2432930705657979) internal successors, (19557), 15730 states have internal predecessors, (19557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15731 states to 15731 states and 19557 transitions. [2024-10-14 03:32:50,321 INFO L78 Accepts]: Start accepts. Automaton has 15731 states and 19557 transitions. Word has length 70 [2024-10-14 03:32:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:50,322 INFO L471 AbstractCegarLoop]: Abstraction has 15731 states and 19557 transitions. [2024-10-14 03:32:50,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.35) internal successors, (167), 19 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-10-14 03:32:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 15731 states and 19557 transitions. [2024-10-14 03:32:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:32:50,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:50,323 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:50,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:32:50,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:50,528 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:50,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash -698799543, now seen corresponding path program 1 times [2024-10-14 03:32:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:50,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205814242] [2024-10-14 03:32:50,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:50,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:50,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:50,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205814242] [2024-10-14 03:32:50,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205814242] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:50,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815196229] [2024-10-14 03:32:50,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:50,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:50,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:50,822 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:32:50,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:32:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:50,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 03:32:50,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:51,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:32:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:51,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815196229] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:32:51,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:32:51,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-14 03:32:51,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472100914] [2024-10-14 03:32:51,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:32:51,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 03:32:51,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:51,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 03:32:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:32:51,848 INFO L87 Difference]: Start difference. First operand 15731 states and 19557 transitions. Second operand has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:53,196 INFO L93 Difference]: Finished difference Result 45536 states and 57019 transitions. [2024-10-14 03:32:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:32:53,199 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 03:32:53,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:53,255 INFO L225 Difference]: With dead ends: 45536 [2024-10-14 03:32:53,255 INFO L226 Difference]: Without dead ends: 31979 [2024-10-14 03:32:53,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:32:53,277 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 905 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:53,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 400 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:32:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31979 states. [2024-10-14 03:32:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31979 to 31499. [2024-10-14 03:32:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31499 states, 31498 states have (on average 1.2286176900120642) internal successors, (38699), 31498 states have internal predecessors, (38699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31499 states to 31499 states and 38699 transitions. [2024-10-14 03:32:54,571 INFO L78 Accepts]: Start accepts. Automaton has 31499 states and 38699 transitions. Word has length 71 [2024-10-14 03:32:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:54,572 INFO L471 AbstractCegarLoop]: Abstraction has 31499 states and 38699 transitions. [2024-10-14 03:32:54,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31499 states and 38699 transitions. [2024-10-14 03:32:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 03:32:54,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:54,577 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:32:54,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 03:32:54,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:54,778 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:54,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash -218188067, now seen corresponding path program 1 times [2024-10-14 03:32:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341278720] [2024-10-14 03:32:54,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341278720] [2024-10-14 03:32:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341278720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14174809] [2024-10-14 03:32:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:57,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:57,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:57,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:32:57,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 03:32:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:57,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-14 03:32:57,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:33:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:33:00,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:33:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:33:06,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14174809] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:33:06,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:33:06,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 22] total 63 [2024-10-14 03:33:06,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926462264] [2024-10-14 03:33:06,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:33:06,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-10-14 03:33:06,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:33:06,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-10-14 03:33:06,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=3543, Unknown=0, NotChecked=0, Total=3906 [2024-10-14 03:33:06,165 INFO L87 Difference]: Start difference. First operand 31499 states and 38699 transitions. Second operand has 63 states, 63 states have (on average 3.142857142857143) internal successors, (198), 63 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)