./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.miim.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.miim.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 8c8574ead59a3d6c844f4988721fe479d7d5d492b1ea6dd2e875c5c9834b070c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:25:46,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:25:46,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:25:46,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:25:46,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:25:46,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:25:46,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:25:46,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:25:46,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:25:46,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:25:46,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:25:46,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:25:46,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:25:46,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:25:46,502 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:25:46,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:25:46,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:25:46,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:25:46,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:25:46,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:25:46,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:25:46,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:25:46,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:25:46,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:25:46,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:25:46,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:25:46,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:25:46,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:25:46,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:25:46,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:25:46,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:25:46,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:25:46,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:25:46,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:25:46,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:25:46,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:25:46,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:25:46,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:25:46,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:25:46,512 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 -> 8c8574ead59a3d6c844f4988721fe479d7d5d492b1ea6dd2e875c5c9834b070c [2024-11-10 02:25:46,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:25:46,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:25:46,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:25:46,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:25:46,850 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:25:46,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.miim.c [2024-11-10 02:25:48,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:25:48,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:25:48,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.miim.c [2024-11-10 02:25:48,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49ce0cc5/660e6655250340c0902d5c6ceec02ebb/FLAG13bd22d85 [2024-11-10 02:25:48,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49ce0cc5/660e6655250340c0902d5c6ceec02ebb [2024-11-10 02:25:48,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:25:48,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:25:48,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:25:48,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:25:48,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:25:48,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:25:48" (1/1) ... [2024-11-10 02:25:48,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39141607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:48, skipping insertion in model container [2024-11-10 02:25:48,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:25:48" (1/1) ... [2024-11-10 02:25:48,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:25:49,140 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.miim.c[1244,1257] [2024-11-10 02:25:49,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:25:49,399 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:25:49,416 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.miim.c[1244,1257] [2024-11-10 02:25:49,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:25:49,546 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:25:49,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49 WrapperNode [2024-11-10 02:25:49,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:25:49,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:25:49,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:25:49,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:25:49,555 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:25:49" (1/1) ... [2024-11-10 02:25:49,586 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:25:49" (1/1) ... [2024-11-10 02:25:49,900 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1717 [2024-11-10 02:25:49,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:25:49,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:25:49,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:25:49,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:25:49,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (1/1) ... [2024-11-10 02:25:49,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (1/1) ... [2024-11-10 02:25:49,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (1/1) ... [2024-11-10 02:25:50,038 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-10 02:25:50,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (1/1) ... [2024-11-10 02:25:50,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (1/1) ... [2024-11-10 02:25:50,090 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (1/1) ... [2024-11-10 02:25:50,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (1/1) ... [2024-11-10 02:25:50,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (1/1) ... [2024-11-10 02:25:50,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (1/1) ... [2024-11-10 02:25:50,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:25:50,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:25:50,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:25:50,172 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:25:50,172 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (1/1) ... [2024-11-10 02:25:50,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:25:50,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:25:50,207 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:25:50,209 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:25:50,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:25:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:25:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 02:25:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:25:50,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:25:50,478 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:25:50,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:25:51,963 INFO L? ?]: Removed 833 outVars from TransFormulas that were not future-live. [2024-11-10 02:25:51,963 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:25:52,040 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:25:52,042 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:25:52,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:25:52 BoogieIcfgContainer [2024-11-10 02:25:52,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:25:52,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:25:52,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:25:52,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:25:52,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:25:48" (1/3) ... [2024-11-10 02:25:52,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60452dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:25:52, skipping insertion in model container [2024-11-10 02:25:52,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:25:49" (2/3) ... [2024-11-10 02:25:52,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60452dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:25:52, skipping insertion in model container [2024-11-10 02:25:52,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:25:52" (3/3) ... [2024-11-10 02:25:52,054 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.miim.c [2024-11-10 02:25:52,070 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:25:52,071 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:25:52,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:25:52,152 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;@1b72efce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:25:52,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:25:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 329 states, 327 states have (on average 1.492354740061162) internal successors, (488), 328 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:25:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 02:25:52,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:25:52,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:25:52,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:25:52,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:25:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -856925501, now seen corresponding path program 1 times [2024-11-10 02:25:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:25:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085102472] [2024-11-10 02:25:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:25:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:25:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:25:52,973 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:25:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:25:52,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085102472] [2024-11-10 02:25:52,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085102472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:25:52,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:25:52,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:25:52,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675930634] [2024-11-10 02:25:52,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:25:52,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:25:52,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:25:53,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:25:53,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:25:53,012 INFO L87 Difference]: Start difference. First operand has 329 states, 327 states have (on average 1.492354740061162) internal successors, (488), 328 states have internal predecessors, (488), 0 states have call successors, (0), 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 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:25:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:25:53,248 INFO L93 Difference]: Finished difference Result 557 states and 829 transitions. [2024-11-10 02:25:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:25:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-10 02:25:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:25:53,266 INFO L225 Difference]: With dead ends: 557 [2024-11-10 02:25:53,267 INFO L226 Difference]: Without dead ends: 326 [2024-11-10 02:25:53,271 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:25:53,276 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:25:53,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1198 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:25:53,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-10 02:25:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-10 02:25:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4892307692307691) internal successors, (484), 325 states have internal predecessors, (484), 0 states have call successors, (0), 0 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:25:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2024-11-10 02:25:53,340 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 76 [2024-11-10 02:25:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:25:53,341 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2024-11-10 02:25:53,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:25:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2024-11-10 02:25:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 02:25:53,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:25:53,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:25:53,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:25:53,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:25:53,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:25:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash -649833070, now seen corresponding path program 1 times [2024-11-10 02:25:53,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:25:53,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528006505] [2024-11-10 02:25:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:25:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:25:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:25:53,679 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:25:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:25:53,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528006505] [2024-11-10 02:25:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528006505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:25:53,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:25:53,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:25:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440135936] [2024-11-10 02:25:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:25:53,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:25:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:25:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:25:53,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:25:53,687 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:25:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:25:53,886 INFO L93 Difference]: Finished difference Result 556 states and 825 transitions. [2024-11-10 02:25:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:25:53,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 02:25:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:25:53,889 INFO L225 Difference]: With dead ends: 556 [2024-11-10 02:25:53,889 INFO L226 Difference]: Without dead ends: 328 [2024-11-10 02:25:53,894 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:25:53,895 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 0 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:25:53,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1195 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:25:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-10 02:25:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-11-10 02:25:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.4862385321100917) internal successors, (486), 327 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:25:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 486 transitions. [2024-11-10 02:25:53,919 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 486 transitions. Word has length 77 [2024-11-10 02:25:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:25:53,920 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 486 transitions. [2024-11-10 02:25:53,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:25:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 486 transitions. [2024-11-10 02:25:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 02:25:53,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:25:53,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:53,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:25:53,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:25:53,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:25:53,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1077255176, now seen corresponding path program 1 times [2024-11-10 02:25:53,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:25:53,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591730651] [2024-11-10 02:25:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:25:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:25:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:25:54,572 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:25:54,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:25:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591730651] [2024-11-10 02:25:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591730651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:25:54,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:25:54,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:25:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804572806] [2024-11-10 02:25:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:25:54,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:25:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:25:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:25:54,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:25:54,576 INFO L87 Difference]: Start difference. First operand 328 states and 486 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:25:54,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:25:54,804 INFO L93 Difference]: Finished difference Result 558 states and 826 transitions. [2024-11-10 02:25:54,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:25:54,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-10 02:25:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:25:54,806 INFO L225 Difference]: With dead ends: 558 [2024-11-10 02:25:54,806 INFO L226 Difference]: Without dead ends: 328 [2024-11-10 02:25:54,808 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:25:54,809 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 26 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:25:54,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1160 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:25:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-10 02:25:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-11-10 02:25:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.4831804281345566) internal successors, (485), 327 states have internal predecessors, (485), 0 states have call successors, (0), 0 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:25:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 485 transitions. [2024-11-10 02:25:54,834 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 485 transitions. Word has length 78 [2024-11-10 02:25:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:25:54,835 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 485 transitions. [2024-11-10 02:25:54,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:25:54,837 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 485 transitions. [2024-11-10 02:25:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 02:25:54,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:25:54,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:25:54,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:25:54,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:25:54,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:25:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1739835085, now seen corresponding path program 1 times [2024-11-10 02:25:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:25:54,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260294478] [2024-11-10 02:25:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:25:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:25:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:25:55,486 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:25:55,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:25:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260294478] [2024-11-10 02:25:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260294478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:25:55,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:25:55,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:25:55,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529638980] [2024-11-10 02:25:55,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:25:55,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:25:55,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:25:55,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:25:55,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:25:55,492 INFO L87 Difference]: Start difference. First operand 328 states and 485 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:25:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:25:55,861 INFO L93 Difference]: Finished difference Result 588 states and 868 transitions. [2024-11-10 02:25:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:25:55,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-10 02:25:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:25:55,864 INFO L225 Difference]: With dead ends: 588 [2024-11-10 02:25:55,864 INFO L226 Difference]: Without dead ends: 358 [2024-11-10 02:25:55,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:25:55,868 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 495 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:25:55,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2357 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:25:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-10 02:25:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2024-11-10 02:25:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.4803370786516854) internal successors, (527), 356 states have internal predecessors, (527), 0 states have call successors, (0), 0 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:25:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 527 transitions. [2024-11-10 02:25:55,877 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 527 transitions. Word has length 79 [2024-11-10 02:25:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:25:55,878 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 527 transitions. [2024-11-10 02:25:55,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:25:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 527 transitions. [2024-11-10 02:25:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 02:25:55,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:25:55,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:25:55,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:25:55,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:25:55,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:25:55,884 INFO L85 PathProgramCache]: Analyzing trace with hash 507386859, now seen corresponding path program 1 times [2024-11-10 02:25:55,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:25:55,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304840537] [2024-11-10 02:25:55,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:25:55,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:25:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:25:56,169 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:25:56,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:25:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304840537] [2024-11-10 02:25:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304840537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:25:56,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:25:56,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:25:56,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706729704] [2024-11-10 02:25:56,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:25:56,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:25:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:25:56,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:25:56,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:25:56,172 INFO L87 Difference]: Start difference. First operand 357 states and 527 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:25:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:25:56,666 INFO L93 Difference]: Finished difference Result 622 states and 917 transitions. [2024-11-10 02:25:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:25:56,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 02:25:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:25:56,669 INFO L225 Difference]: With dead ends: 622 [2024-11-10 02:25:56,669 INFO L226 Difference]: Without dead ends: 363 [2024-11-10 02:25:56,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:25:56,672 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 444 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:25:56,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1412 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:25:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-10 02:25:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-11-10 02:25:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 1.477900552486188) internal successors, (535), 362 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:25:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 535 transitions. [2024-11-10 02:25:56,680 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 535 transitions. Word has length 80 [2024-11-10 02:25:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:25:56,681 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 535 transitions. [2024-11-10 02:25:56,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:25:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 535 transitions. [2024-11-10 02:25:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 02:25:56,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:25:56,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:25:56,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 02:25:56,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:25:56,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:25:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1885347901, now seen corresponding path program 1 times [2024-11-10 02:25:56,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:25:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855199381] [2024-11-10 02:25:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:25:56,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:25:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:25:57,636 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:25:57,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:25:57,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855199381] [2024-11-10 02:25:57,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855199381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:25:57,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:25:57,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:25:57,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875354070] [2024-11-10 02:25:57,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:25:57,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:25:57,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:25:57,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:25:57,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:25:57,638 INFO L87 Difference]: Start difference. First operand 363 states and 535 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:25:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:25:58,124 INFO L93 Difference]: Finished difference Result 627 states and 923 transitions. [2024-11-10 02:25:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:25:58,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 02:25:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:25:58,127 INFO L225 Difference]: With dead ends: 627 [2024-11-10 02:25:58,127 INFO L226 Difference]: Without dead ends: 368 [2024-11-10 02:25:58,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-10 02:25:58,128 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 499 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:25:58,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2317 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:25:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-10 02:25:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 367. [2024-11-10 02:25:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 1.4754098360655739) internal successors, (540), 366 states have internal predecessors, (540), 0 states have call successors, (0), 0 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:25:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 540 transitions. [2024-11-10 02:25:58,136 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 540 transitions. Word has length 80 [2024-11-10 02:25:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:25:58,137 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 540 transitions. [2024-11-10 02:25:58,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:25:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 540 transitions. [2024-11-10 02:25:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 02:25:58,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:25:58,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:25:58,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 02:25:58,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:25:58,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:25:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1201313529, now seen corresponding path program 1 times [2024-11-10 02:25:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:25:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824516065] [2024-11-10 02:25:58,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:25:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:25:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:25:58,556 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:25:58,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:25:58,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824516065] [2024-11-10 02:25:58,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824516065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:25:58,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:25:58,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:25:58,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954105221] [2024-11-10 02:25:58,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:25:58,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:25:58,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:25:58,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:25:58,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:25:58,558 INFO L87 Difference]: Start difference. First operand 367 states and 540 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:25:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:25:58,756 INFO L93 Difference]: Finished difference Result 636 states and 934 transitions. [2024-11-10 02:25:58,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:25:58,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-10 02:25:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:25:58,758 INFO L225 Difference]: With dead ends: 636 [2024-11-10 02:25:58,758 INFO L226 Difference]: Without dead ends: 373 [2024-11-10 02:25:58,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:25:58,761 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 418 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1186 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:25:58,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1186 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:25:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-10 02:25:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-11-10 02:25:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.467741935483871) internal successors, (546), 372 states have internal predecessors, (546), 0 states have call successors, (0), 0 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:25:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 546 transitions. [2024-11-10 02:25:58,769 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 546 transitions. Word has length 81 [2024-11-10 02:25:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:25:58,770 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 546 transitions. [2024-11-10 02:25:58,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:25:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 546 transitions. [2024-11-10 02:25:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 02:25:58,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:25:58,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:25:58,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 02:25:58,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:25:58,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:25:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1510686343, now seen corresponding path program 1 times [2024-11-10 02:25:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:25:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249970574] [2024-11-10 02:25:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:25:58,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:25:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:25:59,040 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:25:59,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:25:59,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249970574] [2024-11-10 02:25:59,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249970574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:25:59,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:25:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:25:59,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763212299] [2024-11-10 02:25:59,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:25:59,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:25:59,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:25:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:25:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:25:59,044 INFO L87 Difference]: Start difference. First operand 373 states and 546 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:25:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:25:59,907 INFO L93 Difference]: Finished difference Result 758 states and 1103 transitions. [2024-11-10 02:25:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:25:59,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 02:25:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:25:59,910 INFO L225 Difference]: With dead ends: 758 [2024-11-10 02:25:59,910 INFO L226 Difference]: Without dead ends: 489 [2024-11-10 02:25:59,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:25:59,912 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 744 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 02:25:59,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1215 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 02:25:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-10 02:25:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 394. [2024-11-10 02:25:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.465648854961832) internal successors, (576), 393 states have internal predecessors, (576), 0 states have call successors, (0), 0 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:25:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 576 transitions. [2024-11-10 02:25:59,924 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 576 transitions. Word has length 82 [2024-11-10 02:25:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:25:59,925 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 576 transitions. [2024-11-10 02:25:59,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:25:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 576 transitions. [2024-11-10 02:25:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 02:25:59,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:25:59,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:25:59,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 02:25:59,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:25:59,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:25:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2105143166, now seen corresponding path program 1 times [2024-11-10 02:25:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:25:59,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132152299] [2024-11-10 02:25:59,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:25:59,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:25:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:00,286 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:26:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:00,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132152299] [2024-11-10 02:26:00,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132152299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:00,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:00,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:26:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238583624] [2024-11-10 02:26:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:00,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:26:00,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:00,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:26:00,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:26:00,288 INFO L87 Difference]: Start difference. First operand 394 states and 576 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:26:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:01,411 INFO L93 Difference]: Finished difference Result 873 states and 1272 transitions. [2024-11-10 02:26:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:26:01,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-10 02:26:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:01,415 INFO L225 Difference]: With dead ends: 873 [2024-11-10 02:26:01,415 INFO L226 Difference]: Without dead ends: 598 [2024-11-10 02:26:01,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-10 02:26:01,417 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1066 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:01,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1667 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 02:26:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-10 02:26:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 395. [2024-11-10 02:26:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.4619289340101522) internal successors, (576), 394 states have internal predecessors, (576), 0 states have call successors, (0), 0 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:26:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 576 transitions. [2024-11-10 02:26:01,429 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 576 transitions. Word has length 83 [2024-11-10 02:26:01,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:01,429 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 576 transitions. [2024-11-10 02:26:01,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:26:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 576 transitions. [2024-11-10 02:26:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 02:26:01,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:01,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:26:01,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 02:26:01,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:01,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 241176716, now seen corresponding path program 1 times [2024-11-10 02:26:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:01,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099817351] [2024-11-10 02:26:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:01,693 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:26:01,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099817351] [2024-11-10 02:26:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099817351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:01,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:01,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:26:01,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199859925] [2024-11-10 02:26:01,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:01,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:26:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:01,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:26:01,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:26:01,695 INFO L87 Difference]: Start difference. First operand 395 states and 576 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:26:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:02,060 INFO L93 Difference]: Finished difference Result 723 states and 1044 transitions. [2024-11-10 02:26:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:26:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-10 02:26:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:02,063 INFO L225 Difference]: With dead ends: 723 [2024-11-10 02:26:02,063 INFO L226 Difference]: Without dead ends: 443 [2024-11-10 02:26:02,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:26:02,064 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 596 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:02,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 1929 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:26:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-10 02:26:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 396. [2024-11-10 02:26:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.4582278481012658) internal successors, (576), 395 states have internal predecessors, (576), 0 states have call successors, (0), 0 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:26:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 576 transitions. [2024-11-10 02:26:02,072 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 576 transitions. Word has length 84 [2024-11-10 02:26:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:02,072 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 576 transitions. [2024-11-10 02:26:02,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:26:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 576 transitions. [2024-11-10 02:26:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 02:26:02,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:02,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:26:02,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 02:26:02,074 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:02,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1053474563, now seen corresponding path program 1 times [2024-11-10 02:26:02,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:02,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815719419] [2024-11-10 02:26:02,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:02,289 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:26:02,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815719419] [2024-11-10 02:26:02,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815719419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:02,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:02,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:26:02,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432297546] [2024-11-10 02:26:02,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:02,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:26:02,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:02,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:26:02,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:26:02,291 INFO L87 Difference]: Start difference. First operand 396 states and 576 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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:26:02,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:02,664 INFO L93 Difference]: Finished difference Result 757 states and 1092 transitions. [2024-11-10 02:26:02,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:26:02,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-10 02:26:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:02,666 INFO L225 Difference]: With dead ends: 757 [2024-11-10 02:26:02,666 INFO L226 Difference]: Without dead ends: 472 [2024-11-10 02:26:02,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:26:02,668 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 678 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:02,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1924 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:26:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-10 02:26:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 397. [2024-11-10 02:26:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.4545454545454546) internal successors, (576), 396 states have internal predecessors, (576), 0 states have call successors, (0), 0 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:26:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 576 transitions. [2024-11-10 02:26:02,683 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 576 transitions. Word has length 85 [2024-11-10 02:26:02,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:02,684 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 576 transitions. [2024-11-10 02:26:02,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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:26:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 576 transitions. [2024-11-10 02:26:02,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 02:26:02,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:02,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:26:02,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 02:26:02,686 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:02,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:02,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1353671057, now seen corresponding path program 1 times [2024-11-10 02:26:02,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:02,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084138627] [2024-11-10 02:26:02,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:02,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:02,962 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:26:02,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:02,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084138627] [2024-11-10 02:26:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084138627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:02,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:02,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:26:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368066138] [2024-11-10 02:26:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:02,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:26:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:02,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:26:02,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:26:02,965 INFO L87 Difference]: Start difference. First operand 397 states and 576 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:03,394 INFO L93 Difference]: Finished difference Result 895 states and 1296 transitions. [2024-11-10 02:26:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:26:03,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-10 02:26:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:03,397 INFO L225 Difference]: With dead ends: 895 [2024-11-10 02:26:03,398 INFO L226 Difference]: Without dead ends: 605 [2024-11-10 02:26:03,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:26:03,400 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1072 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:03,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1929 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:26:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-10 02:26:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 398. [2024-11-10 02:26:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.45088161209068) internal successors, (576), 397 states have internal predecessors, (576), 0 states have call successors, (0), 0 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:26:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 576 transitions. [2024-11-10 02:26:03,415 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 576 transitions. Word has length 86 [2024-11-10 02:26:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:03,415 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 576 transitions. [2024-11-10 02:26:03,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 576 transitions. [2024-11-10 02:26:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 02:26:03,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:03,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:26:03,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 02:26:03,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:03,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:03,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1519970936, now seen corresponding path program 1 times [2024-11-10 02:26:03,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:03,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317396531] [2024-11-10 02:26:03,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:03,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:03,635 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:26:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317396531] [2024-11-10 02:26:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317396531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:03,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:03,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:26:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281019762] [2024-11-10 02:26:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:03,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:26:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:26:03,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:26:03,638 INFO L87 Difference]: Start difference. First operand 398 states and 576 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:03,901 INFO L93 Difference]: Finished difference Result 861 states and 1250 transitions. [2024-11-10 02:26:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:26:03,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-10 02:26:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:03,904 INFO L225 Difference]: With dead ends: 861 [2024-11-10 02:26:03,904 INFO L226 Difference]: Without dead ends: 571 [2024-11-10 02:26:03,905 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:26:03,905 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 1015 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:03,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1168 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:26:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-10 02:26:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 385. [2024-11-10 02:26:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.453125) internal successors, (558), 384 states have internal predecessors, (558), 0 states have call successors, (0), 0 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:26:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 558 transitions. [2024-11-10 02:26:03,914 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 558 transitions. Word has length 87 [2024-11-10 02:26:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:03,914 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 558 transitions. [2024-11-10 02:26:03,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 558 transitions. [2024-11-10 02:26:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 02:26:03,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:03,917 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:03,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 02:26:03,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:03,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash -326544604, now seen corresponding path program 1 times [2024-11-10 02:26:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:03,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474231076] [2024-11-10 02:26:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:04,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474231076] [2024-11-10 02:26:04,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474231076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:26:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732622768] [2024-11-10 02:26:04,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:04,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:26:04,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:26:04,561 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:26:04,565 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:26:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:05,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 02:26:05,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:26:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:05,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:26:05,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732622768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:05,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 02:26:05,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-10 02:26:05,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935279775] [2024-11-10 02:26:05,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:05,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:26:05,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:05,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:26:05,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:26:05,588 INFO L87 Difference]: Start difference. First operand 385 states and 558 transitions. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:05,957 INFO L93 Difference]: Finished difference Result 653 states and 949 transitions. [2024-11-10 02:26:05,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:26:05,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-10 02:26:05,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:05,960 INFO L225 Difference]: With dead ends: 653 [2024-11-10 02:26:05,960 INFO L226 Difference]: Without dead ends: 384 [2024-11-10 02:26:05,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:26:05,961 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 366 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:05,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 505 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:26:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-10 02:26:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-10 02:26:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.4490861618798956) internal successors, (555), 383 states have internal predecessors, (555), 0 states have call successors, (0), 0 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:26:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 555 transitions. [2024-11-10 02:26:05,969 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 555 transitions. Word has length 194 [2024-11-10 02:26:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:05,970 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 555 transitions. [2024-11-10 02:26:05,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 555 transitions. [2024-11-10 02:26:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 02:26:05,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:05,972 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:05,996 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:26:06,172 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,SelfDestructingSolverStorable13 [2024-11-10 02:26:06,173 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:06,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:06,174 INFO L85 PathProgramCache]: Analyzing trace with hash -974920192, now seen corresponding path program 1 times [2024-11-10 02:26:06,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:06,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700885002] [2024-11-10 02:26:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:06,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:07,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700885002] [2024-11-10 02:26:07,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700885002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:07,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:07,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:26:07,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797615800] [2024-11-10 02:26:07,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:07,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:26:07,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:07,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:26:07,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:26:07,396 INFO L87 Difference]: Start difference. First operand 384 states and 555 transitions. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 0 states have call successors, (0), 0 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:26:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:07,907 INFO L93 Difference]: Finished difference Result 777 states and 1124 transitions. [2024-11-10 02:26:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 02:26:07,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2024-11-10 02:26:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:07,910 INFO L225 Difference]: With dead ends: 777 [2024-11-10 02:26:07,910 INFO L226 Difference]: Without dead ends: 501 [2024-11-10 02:26:07,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:26:07,911 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 773 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:07,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1400 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:26:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-10 02:26:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 459. [2024-11-10 02:26:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.445414847161572) internal successors, (662), 458 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:26:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 662 transitions. [2024-11-10 02:26:07,923 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 662 transitions. Word has length 195 [2024-11-10 02:26:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:07,923 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 662 transitions. [2024-11-10 02:26:07,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 0 states have call successors, (0), 0 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:26:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 662 transitions. [2024-11-10 02:26:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 02:26:07,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:07,926 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:07,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 02:26:07,927 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:07,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:07,927 INFO L85 PathProgramCache]: Analyzing trace with hash -535468843, now seen corresponding path program 1 times [2024-11-10 02:26:07,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:07,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726227560] [2024-11-10 02:26:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:09,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726227560] [2024-11-10 02:26:09,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726227560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:09,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:09,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:26:09,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843268599] [2024-11-10 02:26:09,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:09,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:26:09,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:09,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:26:09,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:26:09,325 INFO L87 Difference]: Start difference. First operand 459 states and 662 transitions. Second operand has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 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:26:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:09,991 INFO L93 Difference]: Finished difference Result 915 states and 1319 transitions. [2024-11-10 02:26:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 02:26:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2024-11-10 02:26:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:09,995 INFO L225 Difference]: With dead ends: 915 [2024-11-10 02:26:09,995 INFO L226 Difference]: Without dead ends: 647 [2024-11-10 02:26:09,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:26:09,997 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 983 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:09,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1374 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 02:26:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-10 02:26:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 566. [2024-11-10 02:26:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.4513274336283186) internal successors, (820), 565 states have internal predecessors, (820), 0 states have call successors, (0), 0 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:26:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 820 transitions. [2024-11-10 02:26:10,012 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 820 transitions. Word has length 196 [2024-11-10 02:26:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:10,013 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 820 transitions. [2024-11-10 02:26:10,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 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:26:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 820 transitions. [2024-11-10 02:26:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-10 02:26:10,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:10,015 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:10,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 02:26:10,015 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:10,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash 403744759, now seen corresponding path program 1 times [2024-11-10 02:26:10,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:10,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091051587] [2024-11-10 02:26:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091051587] [2024-11-10 02:26:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091051587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:26:11,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131333439] [2024-11-10 02:26:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:11,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:26:11,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:26:11,894 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:26:11,895 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:26:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:12,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 02:26:12,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:26:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:13,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:26:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131333439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 02:26:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-10 02:26:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677957511] [2024-11-10 02:26:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:13,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:26:13,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:13,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:26:13,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:26:13,404 INFO L87 Difference]: Start difference. First operand 566 states and 820 transitions. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 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:26:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:13,986 INFO L93 Difference]: Finished difference Result 939 states and 1364 transitions. [2024-11-10 02:26:13,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:26:13,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2024-11-10 02:26:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:13,988 INFO L225 Difference]: With dead ends: 939 [2024-11-10 02:26:13,989 INFO L226 Difference]: Without dead ends: 566 [2024-11-10 02:26:13,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-10 02:26:13,990 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 746 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:13,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 732 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:26:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-10 02:26:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2024-11-10 02:26:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.4495575221238939) internal successors, (819), 565 states have internal predecessors, (819), 0 states have call successors, (0), 0 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:26:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 819 transitions. [2024-11-10 02:26:14,000 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 819 transitions. Word has length 197 [2024-11-10 02:26:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:14,001 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 819 transitions. [2024-11-10 02:26:14,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 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:26:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 819 transitions. [2024-11-10 02:26:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 02:26:14,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:14,003 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:14,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 02:26:14,204 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,SelfDestructingSolverStorable16 [2024-11-10 02:26:14,205 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:14,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:14,205 INFO L85 PathProgramCache]: Analyzing trace with hash -486067263, now seen corresponding path program 1 times [2024-11-10 02:26:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:14,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691463486] [2024-11-10 02:26:14,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691463486] [2024-11-10 02:26:16,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691463486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:26:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001853655] [2024-11-10 02:26:16,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:16,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:26:16,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:26:16,150 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:26:16,172 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:26:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:16,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 1617 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 02:26:16,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:26:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:17,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:26:17,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001853655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:17,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 02:26:17,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-10 02:26:17,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933658030] [2024-11-10 02:26:17,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:17,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:26:17,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:17,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:26:17,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:26:17,767 INFO L87 Difference]: Start difference. First operand 566 states and 819 transitions. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:18,276 INFO L93 Difference]: Finished difference Result 836 states and 1211 transitions. [2024-11-10 02:26:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:26:18,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2024-11-10 02:26:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:18,279 INFO L225 Difference]: With dead ends: 836 [2024-11-10 02:26:18,279 INFO L226 Difference]: Without dead ends: 568 [2024-11-10 02:26:18,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-10 02:26:18,280 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 884 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:18,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 725 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:26:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-10 02:26:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 567. [2024-11-10 02:26:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 1.4487632508833923) internal successors, (820), 566 states have internal predecessors, (820), 0 states have call successors, (0), 0 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:26:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 820 transitions. [2024-11-10 02:26:18,293 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 820 transitions. Word has length 198 [2024-11-10 02:26:18,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:18,293 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 820 transitions. [2024-11-10 02:26:18,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 820 transitions. [2024-11-10 02:26:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 02:26:18,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:18,295 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:18,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 02:26:18,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 02:26:18,496 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:18,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:18,497 INFO L85 PathProgramCache]: Analyzing trace with hash -538416053, now seen corresponding path program 1 times [2024-11-10 02:26:18,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:18,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131613572] [2024-11-10 02:26:18,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:18,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:20,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:20,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131613572] [2024-11-10 02:26:20,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131613572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:26:20,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268422262] [2024-11-10 02:26:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:20,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:26:20,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:26:20,337 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:26:20,338 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:26:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:21,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 02:26:21,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:26:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:21,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:26:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:22,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268422262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:26:22,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 02:26:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2024-11-10 02:26:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026920769] [2024-11-10 02:26:22,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 02:26:22,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 02:26:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:22,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 02:26:22,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-11-10 02:26:22,989 INFO L87 Difference]: Start difference. First operand 567 states and 820 transitions. Second operand has 22 states, 22 states have (on average 24.90909090909091) internal successors, (548), 22 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:26:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:24,605 INFO L93 Difference]: Finished difference Result 1038 states and 1497 transitions. [2024-11-10 02:26:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 02:26:24,606 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 24.90909090909091) internal successors, (548), 22 states have internal predecessors, (548), 0 states have call successors, (0), 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 199 [2024-11-10 02:26:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:24,609 INFO L225 Difference]: With dead ends: 1038 [2024-11-10 02:26:24,609 INFO L226 Difference]: Without dead ends: 770 [2024-11-10 02:26:24,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 02:26:24,610 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 5319 mSDsluCounter, 3067 mSDsCounter, 0 mSdLazyCounter, 2983 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5319 SdHoareTripleChecker+Valid, 3312 SdHoareTripleChecker+Invalid, 2988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:24,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5319 Valid, 3312 Invalid, 2988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2983 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 02:26:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-10 02:26:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 575. [2024-11-10 02:26:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 1.4459930313588851) internal successors, (830), 574 states have internal predecessors, (830), 0 states have call successors, (0), 0 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:26:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 830 transitions. [2024-11-10 02:26:24,622 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 830 transitions. Word has length 199 [2024-11-10 02:26:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:24,623 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 830 transitions. [2024-11-10 02:26:24,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 24.90909090909091) internal successors, (548), 22 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:26:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 830 transitions. [2024-11-10 02:26:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 02:26:24,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:24,625 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:24,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 02:26:24,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:26:24,826 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:24,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1516435175, now seen corresponding path program 1 times [2024-11-10 02:26:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:24,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543758858] [2024-11-10 02:26:24,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:28,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:28,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543758858] [2024-11-10 02:26:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543758858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:26:28,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580529519] [2024-11-10 02:26:28,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:28,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:26:28,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:28,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:26:28,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:26:28,230 INFO L87 Difference]: Start difference. First operand 575 states and 830 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 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:26:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:28,434 INFO L93 Difference]: Finished difference Result 938 states and 1358 transitions. [2024-11-10 02:26:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:26:28,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2024-11-10 02:26:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:28,437 INFO L225 Difference]: With dead ends: 938 [2024-11-10 02:26:28,437 INFO L226 Difference]: Without dead ends: 579 [2024-11-10 02:26:28,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:26:28,439 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 360 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:28,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1180 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:26:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-10 02:26:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2024-11-10 02:26:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.4429065743944636) internal successors, (834), 578 states have internal predecessors, (834), 0 states have call successors, (0), 0 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:26:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 834 transitions. [2024-11-10 02:26:28,450 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 834 transitions. Word has length 201 [2024-11-10 02:26:28,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:28,450 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 834 transitions. [2024-11-10 02:26:28,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 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:26:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 834 transitions. [2024-11-10 02:26:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 02:26:28,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:28,452 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:28,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 02:26:28,453 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:28,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:28,453 INFO L85 PathProgramCache]: Analyzing trace with hash 487463243, now seen corresponding path program 1 times [2024-11-10 02:26:28,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:28,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240031529] [2024-11-10 02:26:28,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:28,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240031529] [2024-11-10 02:26:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240031529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:30,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:26:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353230093] [2024-11-10 02:26:30,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:30,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:26:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:30,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:26:30,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:26:30,691 INFO L87 Difference]: Start difference. First operand 579 states and 834 transitions. Second operand has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:26:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:30,980 INFO L93 Difference]: Finished difference Result 944 states and 1364 transitions. [2024-11-10 02:26:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 02:26:30,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2024-11-10 02:26:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:30,982 INFO L225 Difference]: With dead ends: 944 [2024-11-10 02:26:30,983 INFO L226 Difference]: Without dead ends: 583 [2024-11-10 02:26:30,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:26:30,984 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 358 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:30,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1523 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:26:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-10 02:26:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 579. [2024-11-10 02:26:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.4429065743944636) internal successors, (834), 578 states have internal predecessors, (834), 0 states have call successors, (0), 0 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:26:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 834 transitions. [2024-11-10 02:26:30,994 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 834 transitions. Word has length 202 [2024-11-10 02:26:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:30,994 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 834 transitions. [2024-11-10 02:26:30,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:26:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 834 transitions. [2024-11-10 02:26:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 02:26:30,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:30,997 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:30,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 02:26:30,997 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:30,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash 278990566, now seen corresponding path program 1 times [2024-11-10 02:26:30,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:30,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146747015] [2024-11-10 02:26:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146747015] [2024-11-10 02:26:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146747015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:33,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:33,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:26:33,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794384925] [2024-11-10 02:26:33,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:33,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:26:33,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:33,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:26:33,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:26:33,415 INFO L87 Difference]: Start difference. First operand 579 states and 834 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:26:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:33,587 INFO L93 Difference]: Finished difference Result 948 states and 1368 transitions. [2024-11-10 02:26:33,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:26:33,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2024-11-10 02:26:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:33,591 INFO L225 Difference]: With dead ends: 948 [2024-11-10 02:26:33,591 INFO L226 Difference]: Without dead ends: 587 [2024-11-10 02:26:33,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:26:33,592 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 361 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:33,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1180 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:26:33,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-10 02:26:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2024-11-10 02:26:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4383561643835616) internal successors, (840), 584 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:26:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 840 transitions. [2024-11-10 02:26:33,603 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 840 transitions. Word has length 202 [2024-11-10 02:26:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:33,604 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 840 transitions. [2024-11-10 02:26:33,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:26:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 840 transitions. [2024-11-10 02:26:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 02:26:33,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:33,606 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:33,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 02:26:33,606 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:33,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:33,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1387994385, now seen corresponding path program 1 times [2024-11-10 02:26:33,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:33,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683543265] [2024-11-10 02:26:33,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:33,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683543265] [2024-11-10 02:26:36,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683543265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:36,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:36,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 02:26:36,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577668471] [2024-11-10 02:26:36,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:36,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 02:26:36,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:36,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 02:26:36,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:26:36,749 INFO L87 Difference]: Start difference. First operand 585 states and 840 transitions. Second operand has 10 states, 10 states have (on average 20.3) internal successors, (203), 10 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:26:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:37,337 INFO L93 Difference]: Finished difference Result 1153 states and 1648 transitions. [2024-11-10 02:26:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 02:26:37,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 20.3) internal successors, (203), 10 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-11-10 02:26:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:37,340 INFO L225 Difference]: With dead ends: 1153 [2024-11-10 02:26:37,340 INFO L226 Difference]: Without dead ends: 797 [2024-11-10 02:26:37,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-10 02:26:37,342 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 1371 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:37,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 3008 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:26:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-10 02:26:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 705. [2024-11-10 02:26:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.4247159090909092) internal successors, (1003), 704 states have internal predecessors, (1003), 0 states have call successors, (0), 0 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:26:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1003 transitions. [2024-11-10 02:26:37,355 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1003 transitions. Word has length 203 [2024-11-10 02:26:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:37,355 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1003 transitions. [2024-11-10 02:26:37,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.3) internal successors, (203), 10 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:26:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1003 transitions. [2024-11-10 02:26:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 02:26:37,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:37,358 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:37,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 02:26:37,358 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:37,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:37,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1195639052, now seen corresponding path program 1 times [2024-11-10 02:26:37,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:37,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318268316] [2024-11-10 02:26:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:37,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:40,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318268316] [2024-11-10 02:26:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318268316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:40,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:26:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471490378] [2024-11-10 02:26:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:40,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:26:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:40,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:26:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:26:40,713 INFO L87 Difference]: Start difference. First operand 705 states and 1003 transitions. Second operand has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 9 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:26:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:41,335 INFO L93 Difference]: Finished difference Result 1154 states and 1649 transitions. [2024-11-10 02:26:41,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:26:41,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 9 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-11-10 02:26:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:41,381 INFO L225 Difference]: With dead ends: 1154 [2024-11-10 02:26:41,381 INFO L226 Difference]: Without dead ends: 798 [2024-11-10 02:26:41,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-10 02:26:41,382 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1348 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:41,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 2584 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:26:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2024-11-10 02:26:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 708. [2024-11-10 02:26:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.422913719943423) internal successors, (1006), 707 states have internal predecessors, (1006), 0 states have call successors, (0), 0 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:26:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1006 transitions. [2024-11-10 02:26:41,395 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1006 transitions. Word has length 203 [2024-11-10 02:26:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:41,395 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1006 transitions. [2024-11-10 02:26:41,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 9 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:26:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1006 transitions. [2024-11-10 02:26:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-10 02:26:41,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:41,397 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:41,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 02:26:41,397 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:41,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:41,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1677868884, now seen corresponding path program 1 times [2024-11-10 02:26:41,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:41,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80140030] [2024-11-10 02:26:41,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:44,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:44,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80140030] [2024-11-10 02:26:44,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80140030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:44,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:44,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:26:44,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978304323] [2024-11-10 02:26:44,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:44,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:26:44,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:44,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:26:44,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:26:44,083 INFO L87 Difference]: Start difference. First operand 708 states and 1006 transitions. Second operand has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:26:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:44,335 INFO L93 Difference]: Finished difference Result 1078 states and 1541 transitions. [2024-11-10 02:26:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 02:26:44,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2024-11-10 02:26:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:44,338 INFO L225 Difference]: With dead ends: 1078 [2024-11-10 02:26:44,338 INFO L226 Difference]: Without dead ends: 708 [2024-11-10 02:26:44,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:26:44,339 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 461 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:44,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1525 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:26:44,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-10 02:26:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 702. [2024-11-10 02:26:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.4222539229671898) internal successors, (997), 701 states have internal predecessors, (997), 0 states have call successors, (0), 0 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:26:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 997 transitions. [2024-11-10 02:26:44,358 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 997 transitions. Word has length 204 [2024-11-10 02:26:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:44,359 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 997 transitions. [2024-11-10 02:26:44,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:26:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 997 transitions. [2024-11-10 02:26:44,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-10 02:26:44,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:44,361 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:44,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 02:26:44,361 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:44,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:44,361 INFO L85 PathProgramCache]: Analyzing trace with hash 815246241, now seen corresponding path program 1 times [2024-11-10 02:26:44,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:44,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748544022] [2024-11-10 02:26:44,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:44,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:46,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748544022] [2024-11-10 02:26:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748544022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:26:46,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528272186] [2024-11-10 02:26:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:46,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:26:46,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:26:46,801 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:26:46,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 02:26:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:47,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 02:26:47,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:26:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:48,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:26:48,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528272186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:48,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 02:26:48,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2024-11-10 02:26:48,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951188572] [2024-11-10 02:26:48,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:48,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:26:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:48,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:26:48,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-10 02:26:48,129 INFO L87 Difference]: Start difference. First operand 702 states and 997 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:26:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:48,619 INFO L93 Difference]: Finished difference Result 1138 states and 1626 transitions. [2024-11-10 02:26:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:26:48,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2024-11-10 02:26:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:48,622 INFO L225 Difference]: With dead ends: 1138 [2024-11-10 02:26:48,622 INFO L226 Difference]: Without dead ends: 622 [2024-11-10 02:26:48,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-10 02:26:48,623 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 728 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:48,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 731 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:26:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-10 02:26:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 581. [2024-11-10 02:26:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.4344827586206896) internal successors, (832), 580 states have internal predecessors, (832), 0 states have call successors, (0), 0 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:26:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 832 transitions. [2024-11-10 02:26:48,632 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 832 transitions. Word has length 204 [2024-11-10 02:26:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:48,633 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 832 transitions. [2024-11-10 02:26:48,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:26:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 832 transitions. [2024-11-10 02:26:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 02:26:48,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:48,634 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:48,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 02:26:48,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 02:26:48,835 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:48,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:48,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1811973837, now seen corresponding path program 1 times [2024-11-10 02:26:48,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:48,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061143460] [2024-11-10 02:26:48,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:48,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:51,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:51,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061143460] [2024-11-10 02:26:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061143460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:51,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:51,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 02:26:51,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796074567] [2024-11-10 02:26:51,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:51,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 02:26:51,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:51,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 02:26:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:26:51,431 INFO L87 Difference]: Start difference. First operand 581 states and 832 transitions. Second operand has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)