./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 7e5038cf4746b0d33da8db40d97242789791fda4fe0e15050faace48f6985f4f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:51:06,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:51:06,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:51:06,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:51:06,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:51:06,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:51:06,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:51:06,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:51:06,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:51:06,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:51:06,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:51:06,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:51:06,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:51:06,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:51:06,533 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:51:06,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:51:06,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:51:06,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:51:06,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:51:06,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:51:06,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:51:06,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:51:06,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:51:06,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:51:06,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:51:06,540 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:51:06,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:51:06,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:51:06,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:51:06,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:51:06,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:51:06,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:51:06,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:51:06,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:51:06,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:51:06,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:51:06,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:51:06,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:51:06,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:51:06,544 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e5038cf4746b0d33da8db40d97242789791fda4fe0e15050faace48f6985f4f [2024-11-10 02:51:06,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:51:06,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:51:06,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:51:06,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:51:06,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:51:06,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c [2024-11-10 02:51:08,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:51:08,609 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:51:08,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c [2024-11-10 02:51:08,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95742562d/2858c4ef849047b68b8d3cf98634587f/FLAG40ba332a4 [2024-11-10 02:51:08,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95742562d/2858c4ef849047b68b8d3cf98634587f [2024-11-10 02:51:08,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:51:08,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:51:08,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:51:08,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:51:08,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:51:08,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:51:08" (1/1) ... [2024-11-10 02:51:08,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24920917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:08, skipping insertion in model container [2024-11-10 02:51:08,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:51:08" (1/1) ... [2024-11-10 02:51:08,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:51:08,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c[1249,1262] [2024-11-10 02:51:09,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:51:09,039 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:51:09,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c[1249,1262] [2024-11-10 02:51:09,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:51:09,175 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:51:09,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09 WrapperNode [2024-11-10 02:51:09,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:51:09,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:51:09,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:51:09,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:51:09,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,387 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1012 [2024-11-10 02:51:09,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:51:09,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:51:09,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:51:09,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:51:09,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,494 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 02:51:09,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:51:09,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:51:09,573 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:51:09,573 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:51:09,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (1/1) ... [2024-11-10 02:51:09,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:51:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:09,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:51:09,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:51:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:51:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:51:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:51:09,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:51:09,850 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:51:09,854 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:51:11,027 INFO L? ?]: Removed 647 outVars from TransFormulas that were not future-live. [2024-11-10 02:51:11,028 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:51:11,089 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:51:11,089 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:51:11,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:51:11 BoogieIcfgContainer [2024-11-10 02:51:11,090 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:51:11,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:51:11,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:51:11,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:51:11,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:51:08" (1/3) ... [2024-11-10 02:51:11,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537cfbac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:51:11, skipping insertion in model container [2024-11-10 02:51:11,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:51:09" (2/3) ... [2024-11-10 02:51:11,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537cfbac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:51:11, skipping insertion in model container [2024-11-10 02:51:11,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:51:11" (3/3) ... [2024-11-10 02:51:11,101 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_loop_v.c [2024-11-10 02:51:11,121 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:51:11,122 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:51:11,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:51:11,288 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;@58b04a8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:51:11,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:51:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 299 states have (on average 1.491638795986622) internal successors, (446), 300 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 02:51:11,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:11,317 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] [2024-11-10 02:51:11,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:11,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:11,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1171362120, now seen corresponding path program 1 times [2024-11-10 02:51:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:11,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554794926] [2024-11-10 02:51:11,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:11,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:11,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554794926] [2024-11-10 02:51:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554794926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:11,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:11,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:51:11,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193904675] [2024-11-10 02:51:11,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:11,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:51:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:11,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:51:11,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:51:11,952 INFO L87 Difference]: Start difference. First operand has 301 states, 299 states have (on average 1.491638795986622) internal successors, (446), 300 states have internal predecessors, (446), 0 states have call successors, (0), 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 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:12,243 INFO L93 Difference]: Finished difference Result 561 states and 835 transitions. [2024-11-10 02:51:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:51:12,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-10 02:51:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:12,256 INFO L225 Difference]: With dead ends: 561 [2024-11-10 02:51:12,256 INFO L226 Difference]: Without dead ends: 298 [2024-11-10 02:51:12,260 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-11-10 02:51:12,263 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 0 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:12,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1093 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-10 02:51:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-10 02:51:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4882154882154883) internal successors, (442), 297 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 442 transitions. [2024-11-10 02:51:12,323 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 442 transitions. Word has length 28 [2024-11-10 02:51:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:12,324 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 442 transitions. [2024-11-10 02:51:12,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions. [2024-11-10 02:51:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 02:51:12,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:12,327 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:12,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:51:12,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:12,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:12,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2097541156, now seen corresponding path program 1 times [2024-11-10 02:51:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:12,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810319138] [2024-11-10 02:51:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:12,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810319138] [2024-11-10 02:51:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810319138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:12,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:12,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:51:12,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464886605] [2024-11-10 02:51:12,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:12,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:51:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:51:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:51:12,487 INFO L87 Difference]: Start difference. First operand 298 states and 442 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:12,673 INFO L93 Difference]: Finished difference Result 560 states and 831 transitions. [2024-11-10 02:51:12,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:51:12,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-10 02:51:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:12,676 INFO L225 Difference]: With dead ends: 560 [2024-11-10 02:51:12,677 INFO L226 Difference]: Without dead ends: 300 [2024-11-10 02:51:12,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-10 02:51:12,680 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 0 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:12,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-10 02:51:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-11-10 02:51:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.4849498327759196) internal successors, (444), 299 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 444 transitions. [2024-11-10 02:51:12,699 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 444 transitions. Word has length 29 [2024-11-10 02:51:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:12,700 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 444 transitions. [2024-11-10 02:51:12,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 444 transitions. [2024-11-10 02:51:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 02:51:12,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:12,701 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] [2024-11-10 02:51:12,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:51:12,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:12,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:12,703 INFO L85 PathProgramCache]: Analyzing trace with hash 346510381, now seen corresponding path program 1 times [2024-11-10 02:51:12,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:12,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63432815] [2024-11-10 02:51:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:12,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:12,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:12,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63432815] [2024-11-10 02:51:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63432815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:12,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111666932] [2024-11-10 02:51:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:12,864 INFO L87 Difference]: Start difference. First operand 300 states and 444 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:13,212 INFO L93 Difference]: Finished difference Result 797 states and 1182 transitions. [2024-11-10 02:51:13,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:13,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-10 02:51:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:13,215 INFO L225 Difference]: With dead ends: 797 [2024-11-10 02:51:13,216 INFO L226 Difference]: Without dead ends: 535 [2024-11-10 02:51:13,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:13,217 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1118 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:13,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 1063 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-10 02:51:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 302. [2024-11-10 02:51:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.4817275747508305) internal successors, (446), 301 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 446 transitions. [2024-11-10 02:51:13,242 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 446 transitions. Word has length 30 [2024-11-10 02:51:13,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:13,242 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 446 transitions. [2024-11-10 02:51:13,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 446 transitions. [2024-11-10 02:51:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 02:51:13,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:13,249 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:13,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:51:13,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:13,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1349716541, now seen corresponding path program 1 times [2024-11-10 02:51:13,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:13,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218098388] [2024-11-10 02:51:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:13,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:14,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:14,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218098388] [2024-11-10 02:51:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218098388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:14,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:14,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:51:14,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147134146] [2024-11-10 02:51:14,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:14,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:51:14,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:14,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:51:14,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:51:14,641 INFO L87 Difference]: Start difference. First operand 302 states and 446 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:14,971 INFO L93 Difference]: Finished difference Result 780 states and 1156 transitions. [2024-11-10 02:51:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 02:51:14,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2024-11-10 02:51:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:14,976 INFO L225 Difference]: With dead ends: 780 [2024-11-10 02:51:14,976 INFO L226 Difference]: Without dead ends: 518 [2024-11-10 02:51:14,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:51:14,981 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1049 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:14,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1315 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-10 02:51:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 327. [2024-11-10 02:51:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.4723926380368098) internal successors, (480), 326 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 480 transitions. [2024-11-10 02:51:14,994 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 480 transitions. Word has length 159 [2024-11-10 02:51:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:14,995 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 480 transitions. [2024-11-10 02:51:14,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 480 transitions. [2024-11-10 02:51:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 02:51:15,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:15,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:15,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:51:15,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:15,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1146130451, now seen corresponding path program 1 times [2024-11-10 02:51:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:15,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212495925] [2024-11-10 02:51:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:15,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:15,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212495925] [2024-11-10 02:51:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212495925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:15,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:15,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:15,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515407034] [2024-11-10 02:51:15,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:15,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:15,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:15,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:15,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:15,714 INFO L87 Difference]: Start difference. First operand 327 states and 480 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:15,953 INFO L93 Difference]: Finished difference Result 782 states and 1157 transitions. [2024-11-10 02:51:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:15,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-11-10 02:51:15,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:15,957 INFO L225 Difference]: With dead ends: 782 [2024-11-10 02:51:15,958 INFO L226 Difference]: Without dead ends: 520 [2024-11-10 02:51:15,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:15,959 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 1054 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:15,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1066 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-10 02:51:15,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 327. [2024-11-10 02:51:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.469325153374233) internal successors, (479), 326 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 479 transitions. [2024-11-10 02:51:15,970 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 479 transitions. Word has length 160 [2024-11-10 02:51:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:15,971 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 479 transitions. [2024-11-10 02:51:15,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 479 transitions. [2024-11-10 02:51:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 02:51:15,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:15,978 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:15,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 02:51:15,978 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:15,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1782798072, now seen corresponding path program 1 times [2024-11-10 02:51:15,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:15,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557064407] [2024-11-10 02:51:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:17,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557064407] [2024-11-10 02:51:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557064407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:17,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:17,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:17,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284899832] [2024-11-10 02:51:17,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:17,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:17,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:17,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:17,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:17,213 INFO L87 Difference]: Start difference. First operand 327 states and 479 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:17,496 INFO L93 Difference]: Finished difference Result 774 states and 1144 transitions. [2024-11-10 02:51:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:17,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-11-10 02:51:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:17,499 INFO L225 Difference]: With dead ends: 774 [2024-11-10 02:51:17,499 INFO L226 Difference]: Without dead ends: 512 [2024-11-10 02:51:17,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:17,503 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1013 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:17,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1052 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-10 02:51:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 350. [2024-11-10 02:51:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.4670487106017192) internal successors, (512), 349 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 512 transitions. [2024-11-10 02:51:17,514 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 512 transitions. Word has length 160 [2024-11-10 02:51:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:17,515 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 512 transitions. [2024-11-10 02:51:17,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 512 transitions. [2024-11-10 02:51:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 02:51:17,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:17,520 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:17,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 02:51:17,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:17,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1183484744, now seen corresponding path program 1 times [2024-11-10 02:51:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:17,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947873513] [2024-11-10 02:51:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:17,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947873513] [2024-11-10 02:51:19,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947873513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:19,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:19,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486464810] [2024-11-10 02:51:19,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:19,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:19,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:19,014 INFO L87 Difference]: Start difference. First operand 350 states and 512 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:19,343 INFO L93 Difference]: Finished difference Result 774 states and 1142 transitions. [2024-11-10 02:51:19,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:19,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2024-11-10 02:51:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:19,346 INFO L225 Difference]: With dead ends: 774 [2024-11-10 02:51:19,347 INFO L226 Difference]: Without dead ends: 512 [2024-11-10 02:51:19,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:19,349 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 983 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:19,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1051 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-10 02:51:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 401. [2024-11-10 02:51:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.4675) internal successors, (587), 400 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 587 transitions. [2024-11-10 02:51:19,360 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 587 transitions. Word has length 162 [2024-11-10 02:51:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:19,362 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 587 transitions. [2024-11-10 02:51:19,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 587 transitions. [2024-11-10 02:51:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 02:51:19,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:19,364 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:19,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 02:51:19,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:19,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:19,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2028125986, now seen corresponding path program 1 times [2024-11-10 02:51:19,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:19,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538040670] [2024-11-10 02:51:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:19,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:20,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538040670] [2024-11-10 02:51:20,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538040670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:20,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:20,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:20,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411216428] [2024-11-10 02:51:20,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:20,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:20,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:20,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:20,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:20,686 INFO L87 Difference]: Start difference. First operand 401 states and 587 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:20,980 INFO L93 Difference]: Finished difference Result 774 states and 1141 transitions. [2024-11-10 02:51:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:20,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-11-10 02:51:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:20,983 INFO L225 Difference]: With dead ends: 774 [2024-11-10 02:51:20,984 INFO L226 Difference]: Without dead ends: 512 [2024-11-10 02:51:20,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:20,986 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 966 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:20,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 1051 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-10 02:51:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 429. [2024-11-10 02:51:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 1.4672897196261683) internal successors, (628), 428 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 628 transitions. [2024-11-10 02:51:20,997 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 628 transitions. Word has length 163 [2024-11-10 02:51:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:20,997 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 628 transitions. [2024-11-10 02:51:20,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 628 transitions. [2024-11-10 02:51:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 02:51:20,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:20,999 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:21,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 02:51:21,000 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:21,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:21,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1117274245, now seen corresponding path program 1 times [2024-11-10 02:51:21,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:21,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832202952] [2024-11-10 02:51:21,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:21,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832202952] [2024-11-10 02:51:22,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832202952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:22,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:22,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093010296] [2024-11-10 02:51:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:22,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:22,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:22,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:22,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:22,063 INFO L87 Difference]: Start difference. First operand 429 states and 628 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:22,348 INFO L93 Difference]: Finished difference Result 774 states and 1140 transitions. [2024-11-10 02:51:22,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:22,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2024-11-10 02:51:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:22,354 INFO L225 Difference]: With dead ends: 774 [2024-11-10 02:51:22,354 INFO L226 Difference]: Without dead ends: 512 [2024-11-10 02:51:22,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:22,356 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 949 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:22,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1051 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-10 02:51:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 457. [2024-11-10 02:51:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.4671052631578947) internal successors, (669), 456 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 669 transitions. [2024-11-10 02:51:22,370 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 669 transitions. Word has length 164 [2024-11-10 02:51:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:22,371 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 669 transitions. [2024-11-10 02:51:22,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 669 transitions. [2024-11-10 02:51:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 02:51:22,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:22,373 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:22,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 02:51:22,373 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:22,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash 721790715, now seen corresponding path program 1 times [2024-11-10 02:51:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:22,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607977682] [2024-11-10 02:51:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:22,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:23,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607977682] [2024-11-10 02:51:23,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607977682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:23,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:23,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:51:23,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685789125] [2024-11-10 02:51:23,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:23,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:51:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:51:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:23,525 INFO L87 Difference]: Start difference. First operand 457 states and 669 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:23,907 INFO L93 Difference]: Finished difference Result 804 states and 1183 transitions. [2024-11-10 02:51:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:51:23,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2024-11-10 02:51:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:23,910 INFO L225 Difference]: With dead ends: 804 [2024-11-10 02:51:23,910 INFO L226 Difference]: Without dead ends: 520 [2024-11-10 02:51:23,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:51:23,911 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 983 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:23,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1758 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-10 02:51:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 459. [2024-11-10 02:51:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.465065502183406) internal successors, (671), 458 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 671 transitions. [2024-11-10 02:51:23,926 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 671 transitions. Word has length 165 [2024-11-10 02:51:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:23,926 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 671 transitions. [2024-11-10 02:51:23,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 671 transitions. [2024-11-10 02:51:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 02:51:23,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:23,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:23,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 02:51:23,929 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:23,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1516476647, now seen corresponding path program 1 times [2024-11-10 02:51:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:23,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696018734] [2024-11-10 02:51:23,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:24,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:24,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696018734] [2024-11-10 02:51:24,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696018734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:24,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:24,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:51:24,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864421865] [2024-11-10 02:51:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:24,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:51:24,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:24,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:51:24,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:24,968 INFO L87 Difference]: Start difference. First operand 459 states and 671 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:25,335 INFO L93 Difference]: Finished difference Result 784 states and 1153 transitions. [2024-11-10 02:51:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:51:25,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-11-10 02:51:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:25,338 INFO L225 Difference]: With dead ends: 784 [2024-11-10 02:51:25,338 INFO L226 Difference]: Without dead ends: 522 [2024-11-10 02:51:25,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:51:25,340 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 967 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:25,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1656 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-10 02:51:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 462. [2024-11-10 02:51:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.4642082429501084) internal successors, (675), 461 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 675 transitions. [2024-11-10 02:51:25,349 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 675 transitions. Word has length 166 [2024-11-10 02:51:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:25,350 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 675 transitions. [2024-11-10 02:51:25,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 675 transitions. [2024-11-10 02:51:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 02:51:25,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:25,352 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:25,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 02:51:25,352 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:25,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1361376928, now seen corresponding path program 1 times [2024-11-10 02:51:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:25,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246528828] [2024-11-10 02:51:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:26,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:26,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246528828] [2024-11-10 02:51:26,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246528828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:26,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:26,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:26,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927296367] [2024-11-10 02:51:26,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:26,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:26,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:26,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:26,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:26,595 INFO L87 Difference]: Start difference. First operand 462 states and 675 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:26,882 INFO L93 Difference]: Finished difference Result 778 states and 1143 transitions. [2024-11-10 02:51:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:26,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 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 167 [2024-11-10 02:51:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:26,885 INFO L225 Difference]: With dead ends: 778 [2024-11-10 02:51:26,885 INFO L226 Difference]: Without dead ends: 516 [2024-11-10 02:51:26,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:26,886 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 930 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:26,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1051 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-10 02:51:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 489. [2024-11-10 02:51:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.4631147540983607) internal successors, (714), 488 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 714 transitions. [2024-11-10 02:51:26,897 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 714 transitions. Word has length 167 [2024-11-10 02:51:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:26,897 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 714 transitions. [2024-11-10 02:51:26,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 714 transitions. [2024-11-10 02:51:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 02:51:26,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:26,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:26,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 02:51:26,900 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:26,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2136299139, now seen corresponding path program 1 times [2024-11-10 02:51:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:26,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681828862] [2024-11-10 02:51:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:28,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681828862] [2024-11-10 02:51:28,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681828862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:28,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:28,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:51:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853654855] [2024-11-10 02:51:28,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:28,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:51:28,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:28,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:51:28,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:28,096 INFO L87 Difference]: Start difference. First operand 489 states and 714 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:28,469 INFO L93 Difference]: Finished difference Result 786 states and 1154 transitions. [2024-11-10 02:51:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:51:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-11-10 02:51:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:28,472 INFO L225 Difference]: With dead ends: 786 [2024-11-10 02:51:28,472 INFO L226 Difference]: Without dead ends: 524 [2024-11-10 02:51:28,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:51:28,473 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 949 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:28,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1758 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-10 02:51:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 492. [2024-11-10 02:51:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.4623217922606924) internal successors, (718), 491 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 718 transitions. [2024-11-10 02:51:28,483 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 718 transitions. Word has length 168 [2024-11-10 02:51:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:28,483 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 718 transitions. [2024-11-10 02:51:28,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 718 transitions. [2024-11-10 02:51:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 02:51:28,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:28,485 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:28,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 02:51:28,486 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:28,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:28,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1127061911, now seen corresponding path program 1 times [2024-11-10 02:51:28,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:28,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639235418] [2024-11-10 02:51:28,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:28,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:29,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:29,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639235418] [2024-11-10 02:51:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639235418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:29,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:29,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679471772] [2024-11-10 02:51:29,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:29,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:29,477 INFO L87 Difference]: Start difference. First operand 492 states and 718 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:29,756 INFO L93 Difference]: Finished difference Result 783 states and 1149 transitions. [2024-11-10 02:51:29,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2024-11-10 02:51:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:29,759 INFO L225 Difference]: With dead ends: 783 [2024-11-10 02:51:29,759 INFO L226 Difference]: Without dead ends: 521 [2024-11-10 02:51:29,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:29,760 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 918 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:29,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1048 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-10 02:51:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2024-11-10 02:51:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.4613899613899615) internal successors, (757), 518 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 757 transitions. [2024-11-10 02:51:29,771 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 757 transitions. Word has length 169 [2024-11-10 02:51:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:29,771 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 757 transitions. [2024-11-10 02:51:29,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 757 transitions. [2024-11-10 02:51:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 02:51:29,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:29,773 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:29,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 02:51:29,773 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:29,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1897914083, now seen corresponding path program 1 times [2024-11-10 02:51:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255102882] [2024-11-10 02:51:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:30,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:30,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255102882] [2024-11-10 02:51:30,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255102882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:30,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:30,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:51:30,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55032703] [2024-11-10 02:51:30,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:30,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:51:30,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:30,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:51:30,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:30,760 INFO L87 Difference]: Start difference. First operand 519 states and 757 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:31,096 INFO L93 Difference]: Finished difference Result 788 states and 1155 transitions. [2024-11-10 02:51:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:51:31,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-11-10 02:51:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:31,099 INFO L225 Difference]: With dead ends: 788 [2024-11-10 02:51:31,099 INFO L226 Difference]: Without dead ends: 526 [2024-11-10 02:51:31,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:51:31,101 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 927 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:31,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1553 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-10 02:51:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 522. [2024-11-10 02:51:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.4606525911708252) internal successors, (761), 521 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 761 transitions. [2024-11-10 02:51:31,111 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 761 transitions. Word has length 170 [2024-11-10 02:51:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:31,112 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 761 transitions. [2024-11-10 02:51:31,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 761 transitions. [2024-11-10 02:51:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 02:51:31,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:31,114 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:31,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 02:51:31,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:31,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:31,115 INFO L85 PathProgramCache]: Analyzing trace with hash -645139010, now seen corresponding path program 1 times [2024-11-10 02:51:31,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:31,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381498990] [2024-11-10 02:51:31,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:31,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:32,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:32,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381498990] [2024-11-10 02:51:32,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381498990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:32,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064232759] [2024-11-10 02:51:32,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:32,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:32,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:32,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:32,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:32,106 INFO L87 Difference]: Start difference. First operand 522 states and 761 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:32,432 INFO L93 Difference]: Finished difference Result 903 states and 1320 transitions. [2024-11-10 02:51:32,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:32,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2024-11-10 02:51:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:32,435 INFO L225 Difference]: With dead ends: 903 [2024-11-10 02:51:32,435 INFO L226 Difference]: Without dead ends: 522 [2024-11-10 02:51:32,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:32,438 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 974 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:32,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1052 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-10 02:51:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2024-11-10 02:51:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.4587332053742803) internal successors, (760), 521 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 760 transitions. [2024-11-10 02:51:32,449 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 760 transitions. Word has length 171 [2024-11-10 02:51:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:32,449 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 760 transitions. [2024-11-10 02:51:32,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 760 transitions. [2024-11-10 02:51:32,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 02:51:32,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:32,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:32,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 02:51:32,452 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:32,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:32,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1505664079, now seen corresponding path program 1 times [2024-11-10 02:51:32,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:32,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350293360] [2024-11-10 02:51:32,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:32,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:34,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350293360] [2024-11-10 02:51:34,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350293360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:34,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:34,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:34,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942510599] [2024-11-10 02:51:34,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:34,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:34,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:34,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:34,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:34,245 INFO L87 Difference]: Start difference. First operand 522 states and 760 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:34,595 INFO L93 Difference]: Finished difference Result 817 states and 1197 transitions. [2024-11-10 02:51:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:34,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-11-10 02:51:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:34,598 INFO L225 Difference]: With dead ends: 817 [2024-11-10 02:51:34,598 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 02:51:34,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:34,599 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 250 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:34,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1332 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 02:51:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2024-11-10 02:51:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4583333333333333) internal successors, (805), 552 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 805 transitions. [2024-11-10 02:51:34,609 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 805 transitions. Word has length 172 [2024-11-10 02:51:34,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:34,610 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 805 transitions. [2024-11-10 02:51:34,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 805 transitions. [2024-11-10 02:51:34,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 02:51:34,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:34,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:34,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 02:51:34,612 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:34,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1455606019, now seen corresponding path program 1 times [2024-11-10 02:51:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641585240] [2024-11-10 02:51:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:35,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641585240] [2024-11-10 02:51:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641585240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818108336] [2024-11-10 02:51:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:35,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:35,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:35,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:35,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 02:51:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:36,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 02:51:36,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:36,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:51:36,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818108336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:36,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 02:51:36,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-10 02:51:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451023359] [2024-11-10 02:51:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:36,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:51:36,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:36,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:51:36,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-10 02:51:36,692 INFO L87 Difference]: Start difference. First operand 553 states and 805 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:37,254 INFO L93 Difference]: Finished difference Result 1037 states and 1513 transitions. [2024-11-10 02:51:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:51:37,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2024-11-10 02:51:37,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:37,257 INFO L225 Difference]: With dead ends: 1037 [2024-11-10 02:51:37,258 INFO L226 Difference]: Without dead ends: 552 [2024-11-10 02:51:37,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-10 02:51:37,259 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 322 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:37,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1819 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:51:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-10 02:51:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-11-10 02:51:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.455535390199637) internal successors, (802), 551 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 802 transitions. [2024-11-10 02:51:37,272 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 802 transitions. Word has length 173 [2024-11-10 02:51:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:37,272 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 802 transitions. [2024-11-10 02:51:37,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 802 transitions. [2024-11-10 02:51:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 02:51:37,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:37,274 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:37,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 02:51:37,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 02:51:37,479 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:37,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2118041747, now seen corresponding path program 1 times [2024-11-10 02:51:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464677519] [2024-11-10 02:51:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:38,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464677519] [2024-11-10 02:51:38,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464677519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:38,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:38,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482469499] [2024-11-10 02:51:38,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:38,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:38,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:38,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:38,332 INFO L87 Difference]: Start difference. First operand 552 states and 802 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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-11-10 02:51:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:38,621 INFO L93 Difference]: Finished difference Result 932 states and 1360 transitions. [2024-11-10 02:51:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:38,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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 174 [2024-11-10 02:51:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:38,623 INFO L225 Difference]: With dead ends: 932 [2024-11-10 02:51:38,624 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 02:51:38,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:38,625 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 949 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:38,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1052 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 02:51:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-10 02:51:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4553734061930783) internal successors, (799), 549 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 799 transitions. [2024-11-10 02:51:38,636 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 799 transitions. Word has length 174 [2024-11-10 02:51:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:38,636 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 799 transitions. [2024-11-10 02:51:38,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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-11-10 02:51:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2024-11-10 02:51:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 02:51:38,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:38,638 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:38,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 02:51:38,639 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:38,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash -86238217, now seen corresponding path program 1 times [2024-11-10 02:51:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:38,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782120694] [2024-11-10 02:51:38,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:38,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:40,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:40,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782120694] [2024-11-10 02:51:40,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782120694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:40,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:40,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:40,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483927175] [2024-11-10 02:51:40,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:40,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:40,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:40,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:40,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:40,139 INFO L87 Difference]: Start difference. First operand 550 states and 799 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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-11-10 02:51:40,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:40,443 INFO L93 Difference]: Finished difference Result 814 states and 1190 transitions. [2024-11-10 02:51:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:40,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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 174 [2024-11-10 02:51:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:40,445 INFO L225 Difference]: With dead ends: 814 [2024-11-10 02:51:40,445 INFO L226 Difference]: Without dead ends: 552 [2024-11-10 02:51:40,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:40,447 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 244 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:40,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1333 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-10 02:51:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 551. [2024-11-10 02:51:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.4545454545454546) internal successors, (800), 550 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 800 transitions. [2024-11-10 02:51:40,457 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 800 transitions. Word has length 174 [2024-11-10 02:51:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:40,458 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 800 transitions. [2024-11-10 02:51:40,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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-11-10 02:51:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2024-11-10 02:51:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 02:51:40,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:40,460 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:40,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 02:51:40,460 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:40,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:40,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1951784750, now seen corresponding path program 1 times [2024-11-10 02:51:40,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:40,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604546061] [2024-11-10 02:51:40,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:40,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604546061] [2024-11-10 02:51:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604546061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028815123] [2024-11-10 02:51:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:41,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:41,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:41,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 02:51:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:42,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-10 02:51:42,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:43,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:51:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028815123] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:51:44,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 02:51:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 36 [2024-11-10 02:51:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653668572] [2024-11-10 02:51:44,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 02:51:44,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 02:51:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:44,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 02:51:44,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 02:51:44,439 INFO L87 Difference]: Start difference. First operand 551 states and 800 transitions. Second operand has 36 states, 36 states have (on average 14.13888888888889) internal successors, (509), 36 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:46,862 INFO L93 Difference]: Finished difference Result 1760 states and 2571 transitions. [2024-11-10 02:51:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 02:51:46,862 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 14.13888888888889) internal successors, (509), 36 states have internal predecessors, (509), 0 states have call successors, (0), 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 175 [2024-11-10 02:51:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:46,867 INFO L225 Difference]: With dead ends: 1760 [2024-11-10 02:51:46,868 INFO L226 Difference]: Without dead ends: 1260 [2024-11-10 02:51:46,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=678, Invalid=3482, Unknown=0, NotChecked=0, Total=4160 [2024-11-10 02:51:46,871 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 6481 mSDsluCounter, 6896 mSDsCounter, 0 mSdLazyCounter, 3198 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6481 SdHoareTripleChecker+Valid, 7194 SdHoareTripleChecker+Invalid, 3212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:46,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6481 Valid, 7194 Invalid, 3212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3198 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 02:51:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2024-11-10 02:51:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1038. [2024-11-10 02:51:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.4532304725168756) internal successors, (1507), 1037 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1507 transitions. [2024-11-10 02:51:46,894 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1507 transitions. Word has length 175 [2024-11-10 02:51:46,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:46,895 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1507 transitions. [2024-11-10 02:51:46,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 14.13888888888889) internal successors, (509), 36 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1507 transitions. [2024-11-10 02:51:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 02:51:46,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:46,897 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:46,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 02:51:47,097 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,SelfDestructingSolverStorable20 [2024-11-10 02:51:47,098 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:47,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash -765247348, now seen corresponding path program 1 times [2024-11-10 02:51:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271599722] [2024-11-10 02:51:47,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:47,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:47,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:47,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271599722] [2024-11-10 02:51:47,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271599722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:47,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:47,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:51:47,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678999393] [2024-11-10 02:51:47,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:47,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:51:47,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:47,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:51:47,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:51:47,521 INFO L87 Difference]: Start difference. First operand 1038 states and 1507 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:47,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:47,750 INFO L93 Difference]: Finished difference Result 1529 states and 2221 transitions. [2024-11-10 02:51:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:47,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2024-11-10 02:51:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:47,755 INFO L225 Difference]: With dead ends: 1529 [2024-11-10 02:51:47,755 INFO L226 Difference]: Without dead ends: 1032 [2024-11-10 02:51:47,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:51:47,757 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1034 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:47,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1063 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:47,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-11-10 02:51:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2024-11-10 02:51:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1031 states have (on average 1.4510184287099903) internal successors, (1496), 1031 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1496 transitions. [2024-11-10 02:51:47,774 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1496 transitions. Word has length 176 [2024-11-10 02:51:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:47,775 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1496 transitions. [2024-11-10 02:51:47,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1496 transitions. [2024-11-10 02:51:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 02:51:47,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:47,778 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:47,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 02:51:47,778 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:47,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 47840552, now seen corresponding path program 1 times [2024-11-10 02:51:47,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:47,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537418263] [2024-11-10 02:51:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:47,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:48,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537418263] [2024-11-10 02:51:48,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537418263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:48,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430461833] [2024-11-10 02:51:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:48,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:48,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:48,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:48,132 INFO L87 Difference]: Start difference. First operand 1032 states and 1496 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:48,334 INFO L93 Difference]: Finished difference Result 2005 states and 2910 transitions. [2024-11-10 02:51:48,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:48,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 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 177 [2024-11-10 02:51:48,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:48,339 INFO L225 Difference]: With dead ends: 2005 [2024-11-10 02:51:48,339 INFO L226 Difference]: Without dead ends: 1029 [2024-11-10 02:51:48,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:48,341 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1052 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:48,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1064 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2024-11-10 02:51:48,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2024-11-10 02:51:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.4494163424124513) internal successors, (1490), 1028 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1490 transitions. [2024-11-10 02:51:48,357 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1490 transitions. Word has length 177 [2024-11-10 02:51:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:48,357 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1490 transitions. [2024-11-10 02:51:48,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1490 transitions. [2024-11-10 02:51:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 02:51:48,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:48,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:48,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 02:51:48,360 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:48,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash -824618525, now seen corresponding path program 1 times [2024-11-10 02:51:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3278311] [2024-11-10 02:51:48,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:48,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:48,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:48,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3278311] [2024-11-10 02:51:48,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3278311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:48,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:48,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:48,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696705195] [2024-11-10 02:51:48,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:48,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:48,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:48,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:48,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:48,673 INFO L87 Difference]: Start difference. First operand 1029 states and 1490 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:48,903 INFO L93 Difference]: Finished difference Result 1768 states and 2572 transitions. [2024-11-10 02:51:48,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:48,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 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 177 [2024-11-10 02:51:48,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:48,906 INFO L225 Difference]: With dead ends: 1768 [2024-11-10 02:51:48,907 INFO L226 Difference]: Without dead ends: 791 [2024-11-10 02:51:48,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:48,908 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 1078 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:48,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1057 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-10 02:51:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2024-11-10 02:51:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.4582278481012658) internal successors, (1152), 790 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1152 transitions. [2024-11-10 02:51:48,921 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1152 transitions. Word has length 177 [2024-11-10 02:51:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:48,922 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1152 transitions. [2024-11-10 02:51:48,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1152 transitions. [2024-11-10 02:51:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-10 02:51:48,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:48,924 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:48,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 02:51:48,925 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:48,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1317865225, now seen corresponding path program 1 times [2024-11-10 02:51:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:48,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340740507] [2024-11-10 02:51:48,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:48,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:50,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340740507] [2024-11-10 02:51:50,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340740507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:50,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:50,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:51:50,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71316116] [2024-11-10 02:51:50,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:50,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:51:50,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:50,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:51:50,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:50,933 INFO L87 Difference]: Start difference. First operand 791 states and 1152 transitions. Second operand has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:51,686 INFO L93 Difference]: Finished difference Result 2663 states and 3940 transitions. [2024-11-10 02:51:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:51:51,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 0 states have call successors, (0), 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 305 [2024-11-10 02:51:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:51,694 INFO L225 Difference]: With dead ends: 2663 [2024-11-10 02:51:51,695 INFO L226 Difference]: Without dead ends: 2153 [2024-11-10 02:51:51,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:51:51,697 INFO L432 NwaCegarLoop]: 840 mSDtfsCounter, 1553 mSDsluCounter, 2327 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 3167 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:51,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 3167 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 02:51:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2024-11-10 02:51:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1249. [2024-11-10 02:51:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.467147435897436) internal successors, (1831), 1248 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1831 transitions. [2024-11-10 02:51:51,741 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1831 transitions. Word has length 305 [2024-11-10 02:51:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:51,741 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1831 transitions. [2024-11-10 02:51:51,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1831 transitions. [2024-11-10 02:51:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-10 02:51:51,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:51,749 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:51,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 02:51:51,750 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:51,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1894350199, now seen corresponding path program 1 times [2024-11-10 02:51:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:51,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128405469] [2024-11-10 02:51:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:51,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:54,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:54,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128405469] [2024-11-10 02:51:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128405469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:51:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831037664] [2024-11-10 02:51:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:54,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:51:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:51:54,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:51:54,343 INFO L87 Difference]: Start difference. First operand 1249 states and 1831 transitions. Second operand has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:55,068 INFO L93 Difference]: Finished difference Result 3160 states and 4665 transitions. [2024-11-10 02:51:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 02:51:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 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 306 [2024-11-10 02:51:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:55,076 INFO L225 Difference]: With dead ends: 3160 [2024-11-10 02:51:55,076 INFO L226 Difference]: Without dead ends: 2192 [2024-11-10 02:51:55,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-10 02:51:55,078 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 1506 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:55,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 3877 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 02:51:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2024-11-10 02:51:55,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1331. [2024-11-10 02:51:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1330 states have (on average 1.4601503759398495) internal successors, (1942), 1330 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1942 transitions. [2024-11-10 02:51:55,104 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1942 transitions. Word has length 306 [2024-11-10 02:51:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:55,104 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1942 transitions. [2024-11-10 02:51:55,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1942 transitions. [2024-11-10 02:51:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-10 02:51:55,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:55,108 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:55,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 02:51:55,108 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:55,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1794693736, now seen corresponding path program 1 times [2024-11-10 02:51:55,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:55,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195470586] [2024-11-10 02:51:55,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 02:51:56,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195470586] [2024-11-10 02:51:56,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195470586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:56,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:56,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:51:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478970310] [2024-11-10 02:51:56,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:56,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:51:56,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:56,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:51:56,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:56,966 INFO L87 Difference]: Start difference. First operand 1331 states and 1942 transitions. Second operand has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:57,312 INFO L93 Difference]: Finished difference Result 2414 states and 3538 transitions. [2024-11-10 02:51:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:51:57,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 0 states have call successors, (0), 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 307 [2024-11-10 02:51:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:57,316 INFO L225 Difference]: With dead ends: 2414 [2024-11-10 02:51:57,316 INFO L226 Difference]: Without dead ends: 1356 [2024-11-10 02:51:57,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:57,318 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 288 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:57,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1584 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:51:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-11-10 02:51:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2024-11-10 02:51:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1355 states have (on average 1.455350553505535) internal successors, (1972), 1355 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1972 transitions. [2024-11-10 02:51:57,340 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1972 transitions. Word has length 307 [2024-11-10 02:51:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:57,341 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1972 transitions. [2024-11-10 02:51:57,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1972 transitions. [2024-11-10 02:51:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-10 02:51:57,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:57,344 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:57,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 02:51:57,345 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:57,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash -164168169, now seen corresponding path program 1 times [2024-11-10 02:51:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:57,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455123775] [2024-11-10 02:51:57,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:52:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 119 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:52:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:52:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455123775] [2024-11-10 02:52:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455123775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:52:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142466222] [2024-11-10 02:52:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:52:02,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:52:02,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:52:02,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:52:02,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 02:52:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:52:03,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 2013 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 02:52:03,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:52:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:52:04,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:52:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 02:52:04,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142466222] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 02:52:04,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:52:04,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 11] total 28 [2024-11-10 02:52:04,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470012553] [2024-11-10 02:52:04,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:52:04,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:52:04,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:52:04,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:52:04,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2024-11-10 02:52:04,813 INFO L87 Difference]: Start difference. First operand 1356 states and 1972 transitions. Second operand has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:52:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:52:05,351 INFO L93 Difference]: Finished difference Result 4086 states and 6020 transitions. [2024-11-10 02:52:05,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 02:52:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 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 307 [2024-11-10 02:52:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:52:05,361 INFO L225 Difference]: With dead ends: 4086 [2024-11-10 02:52:05,361 INFO L226 Difference]: Without dead ends: 3019 [2024-11-10 02:52:05,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2024-11-10 02:52:05,364 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1503 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 2781 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:52:05,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 2781 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:52:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2024-11-10 02:52:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 1569. [2024-11-10 02:52:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 1.4572704081632653) internal successors, (2285), 1568 states have internal predecessors, (2285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:52:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2285 transitions. [2024-11-10 02:52:05,396 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2285 transitions. Word has length 307 [2024-11-10 02:52:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:52:05,396 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2285 transitions. [2024-11-10 02:52:05,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:52:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2285 transitions. [2024-11-10 02:52:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-10 02:52:05,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:52:05,400 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:52:05,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 02:52:05,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:52:05,602 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:52:05,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:52:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2141040001, now seen corresponding path program 1 times [2024-11-10 02:52:05,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:52:05,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257422836] [2024-11-10 02:52:05,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:52:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:52:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:52:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 126 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:52:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:52:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257422836] [2024-11-10 02:52:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257422836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:52:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810858825] [2024-11-10 02:52:07,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:52:07,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:52:07,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:52:07,863 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-11-10 02:52:07,864 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-11-10 02:52:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:52:08,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 02:52:08,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:52:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 117 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:52:09,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:52:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 02:52:09,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810858825] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 02:52:09,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:52:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 9] total 17 [2024-11-10 02:52:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102638623] [2024-11-10 02:52:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:52:09,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:52:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:52:09,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:52:09,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-10 02:52:09,214 INFO L87 Difference]: Start difference. First operand 1569 states and 2285 transitions. Second operand has 7 states, 7 states have (on average 42.285714285714285) internal successors, (296), 7 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:52:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:52:09,660 INFO L93 Difference]: Finished difference Result 3629 states and 5331 transitions. [2024-11-10 02:52:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:52:09,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.285714285714285) internal successors, (296), 7 states have internal predecessors, (296), 0 states have call successors, (0), 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 308 [2024-11-10 02:52:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:52:09,667 INFO L225 Difference]: With dead ends: 3629 [2024-11-10 02:52:09,668 INFO L226 Difference]: Without dead ends: 2349 [2024-11-10 02:52:09,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 608 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-10 02:52:09,670 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 290 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:52:09,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 2698 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:52:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2024-11-10 02:52:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1617. [2024-11-10 02:52:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1616 states have (on average 1.4548267326732673) internal successors, (2351), 1616 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:52:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2351 transitions. [2024-11-10 02:52:09,702 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2351 transitions. Word has length 308 [2024-11-10 02:52:09,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:52:09,702 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2351 transitions. [2024-11-10 02:52:09,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.285714285714285) internal successors, (296), 7 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:52:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2351 transitions. [2024-11-10 02:52:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-10 02:52:09,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:52:09,707 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:52:09,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 02:52:09,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 02:52:09,908 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:52:09,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:52:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash 412140594, now seen corresponding path program 1 times [2024-11-10 02:52:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:52:09,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831594225] [2024-11-10 02:52:09,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:52:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:52:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat