./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label27.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 497301b92ba25c2f1607465beb3fb2acf88756e6c4b878ac8a9bf2f715106635 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:37:11,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:37:11,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:37:11,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:37:11,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:37:11,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:37:11,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:37:11,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:37:11,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:37:11,641 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:37:11,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:37:11,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:37:11,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:37:11,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:37:11,642 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:37:11,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:37:11,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:37:11,643 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:37:11,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:37:11,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:37:11,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:37:11,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:37:11,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:37:11,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:37:11,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:37:11,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:37:11,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:37:11,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:37:11,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:37:11,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:37:11,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:37:11,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:37:11,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:37:11,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:37:11,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:37:11,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:37:11,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:37:11,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:37:11,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:37:11,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:37:11,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:37:11,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:37:11,654 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 497301b92ba25c2f1607465beb3fb2acf88756e6c4b878ac8a9bf2f715106635 [2024-10-10 22:37:11,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:37:11,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:37:11,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:37:11,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:37:11,890 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:37:11,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label27.c [2024-10-10 22:37:13,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:37:13,655 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:37:13,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label27.c [2024-10-10 22:37:13,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d6b2182ae/759c5d3c2f054a3e868ddb5aa97364ba/FLAG0f825eb11 [2024-10-10 22:37:13,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d6b2182ae/759c5d3c2f054a3e868ddb5aa97364ba [2024-10-10 22:37:13,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:37:13,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:37:13,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:37:13,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:37:13,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:37:13,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:37:13" (1/1) ... [2024-10-10 22:37:13,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8fc8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:13, skipping insertion in model container [2024-10-10 22:37:13,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:37:13" (1/1) ... [2024-10-10 22:37:14,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:37:14,441 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label27.c[54867,54880] [2024-10-10 22:37:14,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:37:14,505 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:37:14,784 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label27.c[54867,54880] [2024-10-10 22:37:14,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:37:14,824 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:37:14,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14 WrapperNode [2024-10-10 22:37:14,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:37:14,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:37:14,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:37:14,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:37:14,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:14,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:14,924 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-10 22:37:14,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:37:14,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:37:14,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:37:14,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:37:14,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:14,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:14,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:14,986 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:37:14,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:14,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:15,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:15,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:15,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:15,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:15,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:37:15,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:37:15,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:37:15,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:37:15,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (1/1) ... [2024-10-10 22:37:15,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:37:15,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:15,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:37:15,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:37:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:37:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:37:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:37:15,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:37:15,252 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:37:15,254 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:37:16,745 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-10 22:37:16,746 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:37:16,809 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:37:16,809 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:37:16,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:37:16 BoogieIcfgContainer [2024-10-10 22:37:16,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:37:16,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:37:16,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:37:16,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:37:16,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:37:13" (1/3) ... [2024-10-10 22:37:16,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f60b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:37:16, skipping insertion in model container [2024-10-10 22:37:16,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:14" (2/3) ... [2024-10-10 22:37:16,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f60b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:37:16, skipping insertion in model container [2024-10-10 22:37:16,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:37:16" (3/3) ... [2024-10-10 22:37:16,823 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label27.c [2024-10-10 22:37:16,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:37:16,852 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:37:16,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:37:16,922 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;@251ce559, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:37:16,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:37:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-10 22:37:16,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:16,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:16,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:16,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1686602558, now seen corresponding path program 1 times [2024-10-10 22:37:16,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:16,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375415431] [2024-10-10 22:37:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:16,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:17,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:17,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375415431] [2024-10-10 22:37:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375415431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:17,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884814771] [2024-10-10 22:37:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:17,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:37:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:17,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:37:17,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:37:17,563 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:17,627 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-10 22:37:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:37:17,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-10-10 22:37:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:17,641 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:37:17,641 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:37:17,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:37:17,649 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:17,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:37:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:37:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-10 22:37:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-10 22:37:17,705 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 152 [2024-10-10 22:37:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:17,706 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-10 22:37:17,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-10 22:37:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-10 22:37:17,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:17,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:17,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:37:17,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:17,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash 480697502, now seen corresponding path program 1 times [2024-10-10 22:37:17,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:17,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76889675] [2024-10-10 22:37:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:18,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:18,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76889675] [2024-10-10 22:37:18,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76889675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:18,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:18,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:18,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171136787] [2024-10-10 22:37:18,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:18,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:18,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:18,322 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:19,296 INFO L93 Difference]: Finished difference Result 699 states and 1161 transitions. [2024-10-10 22:37:19,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:19,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-10-10 22:37:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:19,311 INFO L225 Difference]: With dead ends: 699 [2024-10-10 22:37:19,311 INFO L226 Difference]: Without dead ends: 462 [2024-10-10 22:37:19,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:19,314 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 88 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:19,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 83 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:37:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-10 22:37:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 448. [2024-10-10 22:37:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.6353467561521253) internal successors, (731), 447 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 731 transitions. [2024-10-10 22:37:19,386 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 731 transitions. Word has length 152 [2024-10-10 22:37:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:19,387 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 731 transitions. [2024-10-10 22:37:19,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 731 transitions. [2024-10-10 22:37:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-10 22:37:19,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:19,397 INFO L215 NwaCegarLoop]: trace histogram [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-10-10 22:37:19,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:37:19,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:19,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:19,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1910749778, now seen corresponding path program 1 times [2024-10-10 22:37:19,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:19,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270828152] [2024-10-10 22:37:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270828152] [2024-10-10 22:37:19,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270828152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:19,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:19,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:19,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029704461] [2024-10-10 22:37:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:19,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:19,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:19,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:19,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:19,936 INFO L87 Difference]: Start difference. First operand 448 states and 731 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:20,714 INFO L93 Difference]: Finished difference Result 1332 states and 2179 transitions. [2024-10-10 22:37:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-10 22:37:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:20,719 INFO L225 Difference]: With dead ends: 1332 [2024-10-10 22:37:20,719 INFO L226 Difference]: Without dead ends: 885 [2024-10-10 22:37:20,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:20,722 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 285 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:20,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 112 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-10 22:37:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 881. [2024-10-10 22:37:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.6170454545454545) internal successors, (1423), 880 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1423 transitions. [2024-10-10 22:37:20,749 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1423 transitions. Word has length 158 [2024-10-10 22:37:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:20,750 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1423 transitions. [2024-10-10 22:37:20,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1423 transitions. [2024-10-10 22:37:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-10 22:37:20,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:20,758 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:37:20,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:37:20,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:20,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash 740058490, now seen corresponding path program 1 times [2024-10-10 22:37:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305837581] [2024-10-10 22:37:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:20,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:20,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305837581] [2024-10-10 22:37:20,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305837581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:20,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:20,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:20,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755649305] [2024-10-10 22:37:20,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:20,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:20,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:20,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:21,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:21,000 INFO L87 Difference]: Start difference. First operand 881 states and 1423 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:22,031 INFO L93 Difference]: Finished difference Result 2580 states and 4180 transitions. [2024-10-10 22:37:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:22,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-10 22:37:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:22,036 INFO L225 Difference]: With dead ends: 2580 [2024-10-10 22:37:22,037 INFO L226 Difference]: Without dead ends: 1700 [2024-10-10 22:37:22,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:22,039 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 241 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:22,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 164 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 22:37:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2024-10-10 22:37:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1697. [2024-10-10 22:37:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1696 states have (on average 1.4439858490566038) internal successors, (2449), 1696 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2449 transitions. [2024-10-10 22:37:22,065 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2449 transitions. Word has length 158 [2024-10-10 22:37:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:22,065 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2449 transitions. [2024-10-10 22:37:22,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2449 transitions. [2024-10-10 22:37:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-10 22:37:22,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:22,068 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:22,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:37:22,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:22,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:22,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1722204092, now seen corresponding path program 1 times [2024-10-10 22:37:22,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:22,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926218449] [2024-10-10 22:37:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:22,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:22,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:22,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926218449] [2024-10-10 22:37:22,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926218449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:22,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:22,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:22,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350641519] [2024-10-10 22:37:22,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:22,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:22,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:22,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:22,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:22,361 INFO L87 Difference]: Start difference. First operand 1697 states and 2449 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:23,228 INFO L93 Difference]: Finished difference Result 5037 states and 7271 transitions. [2024-10-10 22:37:23,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:23,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2024-10-10 22:37:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:23,240 INFO L225 Difference]: With dead ends: 5037 [2024-10-10 22:37:23,241 INFO L226 Difference]: Without dead ends: 3341 [2024-10-10 22:37:23,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:23,245 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:23,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 112 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2024-10-10 22:37:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 3339. [2024-10-10 22:37:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3339 states, 3338 states have (on average 1.3693828639904133) internal successors, (4571), 3338 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 4571 transitions. [2024-10-10 22:37:23,321 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 4571 transitions. Word has length 162 [2024-10-10 22:37:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:23,322 INFO L471 AbstractCegarLoop]: Abstraction has 3339 states and 4571 transitions. [2024-10-10 22:37:23,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4571 transitions. [2024-10-10 22:37:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-10 22:37:23,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:23,329 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:23,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:37:23,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1154328489, now seen corresponding path program 1 times [2024-10-10 22:37:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184016334] [2024-10-10 22:37:23,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:23,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:23,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184016334] [2024-10-10 22:37:23,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184016334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:23,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:23,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:23,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644159241] [2024-10-10 22:37:23,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:23,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:23,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:23,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:23,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:23,613 INFO L87 Difference]: Start difference. First operand 3339 states and 4571 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:24,438 INFO L93 Difference]: Finished difference Result 9982 states and 13674 transitions. [2024-10-10 22:37:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:24,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2024-10-10 22:37:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:24,460 INFO L225 Difference]: With dead ends: 9982 [2024-10-10 22:37:24,461 INFO L226 Difference]: Without dead ends: 6644 [2024-10-10 22:37:24,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:24,469 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 275 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:24,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 99 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6644 states. [2024-10-10 22:37:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6644 to 6633. [2024-10-10 22:37:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6633 states, 6632 states have (on average 1.3541917973462003) internal successors, (8981), 6632 states have internal predecessors, (8981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 8981 transitions. [2024-10-10 22:37:24,591 INFO L78 Accepts]: Start accepts. Automaton has 6633 states and 8981 transitions. Word has length 164 [2024-10-10 22:37:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:24,592 INFO L471 AbstractCegarLoop]: Abstraction has 6633 states and 8981 transitions. [2024-10-10 22:37:24,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6633 states and 8981 transitions. [2024-10-10 22:37:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-10 22:37:24,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:24,601 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-10-10 22:37:24,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:37:24,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:24,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash 681389139, now seen corresponding path program 1 times [2024-10-10 22:37:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:24,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757007698] [2024-10-10 22:37:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:24,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757007698] [2024-10-10 22:37:24,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757007698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:24,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:24,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:24,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875760928] [2024-10-10 22:37:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:24,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:24,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:24,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:24,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:24,897 INFO L87 Difference]: Start difference. First operand 6633 states and 8981 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:25,993 INFO L93 Difference]: Finished difference Result 16515 states and 21801 transitions. [2024-10-10 22:37:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2024-10-10 22:37:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:26,056 INFO L225 Difference]: With dead ends: 16515 [2024-10-10 22:37:26,057 INFO L226 Difference]: Without dead ends: 9883 [2024-10-10 22:37:26,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:26,078 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 210 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:26,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 185 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 22:37:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9883 states. [2024-10-10 22:37:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9883 to 9881. [2024-10-10 22:37:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9881 states, 9880 states have (on average 1.2818825910931173) internal successors, (12665), 9880 states have internal predecessors, (12665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9881 states to 9881 states and 12665 transitions. [2024-10-10 22:37:26,320 INFO L78 Accepts]: Start accepts. Automaton has 9881 states and 12665 transitions. Word has length 169 [2024-10-10 22:37:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:26,320 INFO L471 AbstractCegarLoop]: Abstraction has 9881 states and 12665 transitions. [2024-10-10 22:37:26,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 9881 states and 12665 transitions. [2024-10-10 22:37:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-10 22:37:26,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:26,328 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2024-10-10 22:37:26,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:37:26,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:26,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1498502215, now seen corresponding path program 1 times [2024-10-10 22:37:26,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:26,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991117504] [2024-10-10 22:37:26,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:26,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:26,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:26,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991117504] [2024-10-10 22:37:26,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991117504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:26,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:26,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:26,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743471322] [2024-10-10 22:37:26,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:26,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:26,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:26,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:26,576 INFO L87 Difference]: Start difference. First operand 9881 states and 12665 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:28,107 INFO L93 Difference]: Finished difference Result 39374 states and 50454 transitions. [2024-10-10 22:37:28,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:28,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2024-10-10 22:37:28,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:28,177 INFO L225 Difference]: With dead ends: 39374 [2024-10-10 22:37:28,177 INFO L226 Difference]: Without dead ends: 29494 [2024-10-10 22:37:28,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:28,196 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 560 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:28,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 119 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 22:37:28,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29494 states. [2024-10-10 22:37:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29494 to 26229. [2024-10-10 22:37:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26229 states, 26228 states have (on average 1.2795485740430075) internal successors, (33560), 26228 states have internal predecessors, (33560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26229 states to 26229 states and 33560 transitions. [2024-10-10 22:37:28,591 INFO L78 Accepts]: Start accepts. Automaton has 26229 states and 33560 transitions. Word has length 179 [2024-10-10 22:37:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:28,591 INFO L471 AbstractCegarLoop]: Abstraction has 26229 states and 33560 transitions. [2024-10-10 22:37:28,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 26229 states and 33560 transitions. [2024-10-10 22:37:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-10 22:37:28,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:28,597 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, 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] [2024-10-10 22:37:28,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:37:28,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:28,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2083378552, now seen corresponding path program 1 times [2024-10-10 22:37:28,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:28,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186389382] [2024-10-10 22:37:28,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:28,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:28,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:28,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186389382] [2024-10-10 22:37:28,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186389382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:28,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:28,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:28,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245843957] [2024-10-10 22:37:28,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:28,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:28,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:28,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:28,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:28,878 INFO L87 Difference]: Start difference. First operand 26229 states and 33560 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:29,692 INFO L93 Difference]: Finished difference Result 75946 states and 97082 transitions. [2024-10-10 22:37:29,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:29,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2024-10-10 22:37:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:29,774 INFO L225 Difference]: With dead ends: 75946 [2024-10-10 22:37:29,774 INFO L226 Difference]: Without dead ends: 49718 [2024-10-10 22:37:29,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:29,811 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 222 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:29,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 143 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49718 states. [2024-10-10 22:37:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49718 to 46862. [2024-10-10 22:37:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46862 states, 46861 states have (on average 1.271355711572523) internal successors, (59577), 46861 states have internal predecessors, (59577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46862 states to 46862 states and 59577 transitions. [2024-10-10 22:37:30,591 INFO L78 Accepts]: Start accepts. Automaton has 46862 states and 59577 transitions. Word has length 180 [2024-10-10 22:37:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:30,592 INFO L471 AbstractCegarLoop]: Abstraction has 46862 states and 59577 transitions. [2024-10-10 22:37:30,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 46862 states and 59577 transitions. [2024-10-10 22:37:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-10 22:37:30,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:30,600 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, 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] [2024-10-10 22:37:30,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:37:30,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:30,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash -6984707, now seen corresponding path program 1 times [2024-10-10 22:37:30,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:30,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097033269] [2024-10-10 22:37:30,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:30,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:31,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097033269] [2024-10-10 22:37:31,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097033269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:31,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:31,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:31,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724420763] [2024-10-10 22:37:31,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:31,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:31,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:31,017 INFO L87 Difference]: Start difference. First operand 46862 states and 59577 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:32,015 INFO L93 Difference]: Finished difference Result 116177 states and 147960 transitions. [2024-10-10 22:37:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2024-10-10 22:37:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:32,137 INFO L225 Difference]: With dead ends: 116177 [2024-10-10 22:37:32,137 INFO L226 Difference]: Without dead ends: 69316 [2024-10-10 22:37:32,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:32,188 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 211 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:32,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 118 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69316 states. [2024-10-10 22:37:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69316 to 69229. [2024-10-10 22:37:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69229 states, 69228 states have (on average 1.2706274917663374) internal successors, (87963), 69228 states have internal predecessors, (87963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69229 states to 69229 states and 87963 transitions. [2024-10-10 22:37:33,429 INFO L78 Accepts]: Start accepts. Automaton has 69229 states and 87963 transitions. Word has length 182 [2024-10-10 22:37:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:33,429 INFO L471 AbstractCegarLoop]: Abstraction has 69229 states and 87963 transitions. [2024-10-10 22:37:33,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 69229 states and 87963 transitions. [2024-10-10 22:37:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-10 22:37:33,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:33,438 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, 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] [2024-10-10 22:37:33,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:37:33,439 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:33,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1804186887, now seen corresponding path program 1 times [2024-10-10 22:37:33,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:33,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333007] [2024-10-10 22:37:33,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:33,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:33,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:33,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333007] [2024-10-10 22:37:33,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:33,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:33,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:33,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846343826] [2024-10-10 22:37:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:33,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:33,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:33,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:33,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:33,894 INFO L87 Difference]: Start difference. First operand 69229 states and 87963 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:34,899 INFO L93 Difference]: Finished difference Result 140490 states and 178199 transitions. [2024-10-10 22:37:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:34,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2024-10-10 22:37:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:34,997 INFO L225 Difference]: With dead ends: 140490 [2024-10-10 22:37:34,998 INFO L226 Difference]: Without dead ends: 71262 [2024-10-10 22:37:35,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:35,044 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 182 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:35,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 188 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71262 states. [2024-10-10 22:37:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71262 to 71259. [2024-10-10 22:37:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71259 states, 71258 states have (on average 1.2661736226107945) internal successors, (90225), 71258 states have internal predecessors, (90225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71259 states to 71259 states and 90225 transitions. [2024-10-10 22:37:36,227 INFO L78 Accepts]: Start accepts. Automaton has 71259 states and 90225 transitions. Word has length 186 [2024-10-10 22:37:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:36,227 INFO L471 AbstractCegarLoop]: Abstraction has 71259 states and 90225 transitions. [2024-10-10 22:37:36,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 71259 states and 90225 transitions. [2024-10-10 22:37:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-10 22:37:36,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:36,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:36,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:37:36,239 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:36,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:36,239 INFO L85 PathProgramCache]: Analyzing trace with hash -3507257, now seen corresponding path program 1 times [2024-10-10 22:37:36,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:36,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143869298] [2024-10-10 22:37:36,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:36,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:36,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143869298] [2024-10-10 22:37:36,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143869298] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803028470] [2024-10-10 22:37:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:36,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:36,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:36,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:36,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:37:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:36,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:37:36,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:37,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:37,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803028470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:37,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:37,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:37,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001323354] [2024-10-10 22:37:37,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:37,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:37,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:37,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:37,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:37,119 INFO L87 Difference]: Start difference. First operand 71259 states and 90225 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:38,317 INFO L93 Difference]: Finished difference Result 173815 states and 219397 transitions. [2024-10-10 22:37:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:38,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 187 [2024-10-10 22:37:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:38,460 INFO L225 Difference]: With dead ends: 173815 [2024-10-10 22:37:38,460 INFO L226 Difference]: Without dead ends: 103369 [2024-10-10 22:37:38,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:38,516 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 116 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:38,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 382 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103369 states. [2024-10-10 22:37:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103369 to 82412. [2024-10-10 22:37:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82412 states, 82411 states have (on average 1.221378214073364) internal successors, (100655), 82411 states have internal predecessors, (100655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82412 states to 82412 states and 100655 transitions. [2024-10-10 22:37:40,232 INFO L78 Accepts]: Start accepts. Automaton has 82412 states and 100655 transitions. Word has length 187 [2024-10-10 22:37:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:40,233 INFO L471 AbstractCegarLoop]: Abstraction has 82412 states and 100655 transitions. [2024-10-10 22:37:40,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 82412 states and 100655 transitions. [2024-10-10 22:37:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-10 22:37:40,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:40,245 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:40,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:37:40,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 22:37:40,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:40,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:40,447 INFO L85 PathProgramCache]: Analyzing trace with hash 673795351, now seen corresponding path program 1 times [2024-10-10 22:37:40,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:40,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428085998] [2024-10-10 22:37:40,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:40,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:40,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428085998] [2024-10-10 22:37:40,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428085998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:40,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:40,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808496481] [2024-10-10 22:37:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:40,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:40,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:40,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:40,758 INFO L87 Difference]: Start difference. First operand 82412 states and 100655 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 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-10-10 22:37:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:42,418 INFO L93 Difference]: Finished difference Result 199232 states and 242313 transitions. [2024-10-10 22:37:42,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:42,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 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 201 [2024-10-10 22:37:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:42,574 INFO L225 Difference]: With dead ends: 199232 [2024-10-10 22:37:42,574 INFO L226 Difference]: Without dead ends: 117633 [2024-10-10 22:37:42,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:42,639 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 194 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:42,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 412 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 22:37:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117633 states. [2024-10-10 22:37:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117633 to 101285. [2024-10-10 22:37:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101285 states, 101284 states have (on average 1.1880257493779867) internal successors, (120328), 101284 states have internal predecessors, (120328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101285 states to 101285 states and 120328 transitions. [2024-10-10 22:37:44,789 INFO L78 Accepts]: Start accepts. Automaton has 101285 states and 120328 transitions. Word has length 201 [2024-10-10 22:37:44,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:44,789 INFO L471 AbstractCegarLoop]: Abstraction has 101285 states and 120328 transitions. [2024-10-10 22:37:44,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 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-10-10 22:37:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 101285 states and 120328 transitions. [2024-10-10 22:37:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-10 22:37:44,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:44,799 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:44,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:37:44,800 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:44,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1240448064, now seen corresponding path program 1 times [2024-10-10 22:37:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:44,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688202839] [2024-10-10 22:37:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:44,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688202839] [2024-10-10 22:37:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688202839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650076590] [2024-10-10 22:37:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:44,999 INFO L87 Difference]: Start difference. First operand 101285 states and 120328 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:46,924 INFO L93 Difference]: Finished difference Result 266783 states and 318029 transitions. [2024-10-10 22:37:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:46,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2024-10-10 22:37:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:47,198 INFO L225 Difference]: With dead ends: 266783 [2024-10-10 22:37:47,198 INFO L226 Difference]: Without dead ends: 165702 [2024-10-10 22:37:47,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:47,303 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 237 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:47,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 206 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165702 states. [2024-10-10 22:37:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165702 to 157306. [2024-10-10 22:37:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157306 states, 157305 states have (on average 1.1949779091573693) internal successors, (187976), 157305 states have internal predecessors, (187976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157306 states to 157306 states and 187976 transitions. [2024-10-10 22:37:50,411 INFO L78 Accepts]: Start accepts. Automaton has 157306 states and 187976 transitions. Word has length 206 [2024-10-10 22:37:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:50,413 INFO L471 AbstractCegarLoop]: Abstraction has 157306 states and 187976 transitions. [2024-10-10 22:37:50,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 157306 states and 187976 transitions. [2024-10-10 22:37:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-10 22:37:50,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:50,425 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:37:50,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:37:50,425 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:50,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 715577970, now seen corresponding path program 1 times [2024-10-10 22:37:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:50,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094660829] [2024-10-10 22:37:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:51,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:51,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094660829] [2024-10-10 22:37:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094660829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371417650] [2024-10-10 22:37:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:51,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:51,239 INFO L87 Difference]: Start difference. First operand 157306 states and 187976 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:53,881 INFO L93 Difference]: Finished difference Result 337930 states and 405660 transitions. [2024-10-10 22:37:53,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:53,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 217 [2024-10-10 22:37:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:54,316 INFO L225 Difference]: With dead ends: 337930 [2024-10-10 22:37:54,316 INFO L226 Difference]: Without dead ends: 183061 [2024-10-10 22:37:54,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:54,426 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 428 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:54,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 163 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 22:37:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183061 states. [2024-10-10 22:37:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183061 to 164614. [2024-10-10 22:37:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164614 states, 164613 states have (on average 1.208246007301975) internal successors, (198893), 164613 states have internal predecessors, (198893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164614 states to 164614 states and 198893 transitions. [2024-10-10 22:37:58,054 INFO L78 Accepts]: Start accepts. Automaton has 164614 states and 198893 transitions. Word has length 217 [2024-10-10 22:37:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:58,055 INFO L471 AbstractCegarLoop]: Abstraction has 164614 states and 198893 transitions. [2024-10-10 22:37:58,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 164614 states and 198893 transitions. [2024-10-10 22:37:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-10 22:37:58,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:58,071 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:37:58,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:37:58,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:58,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1835513469, now seen corresponding path program 1 times [2024-10-10 22:37:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131142858] [2024-10-10 22:37:58,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:58,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 22:37:58,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131142858] [2024-10-10 22:37:58,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131142858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163944693] [2024-10-10 22:37:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:58,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:58,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:58,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:58,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:37:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:58,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:58,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-10 22:37:58,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:58,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163944693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:58,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:58,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250021332] [2024-10-10 22:37:58,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:58,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:58,763 INFO L87 Difference]: Start difference. First operand 164614 states and 198893 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:00,664 INFO L93 Difference]: Finished difference Result 373328 states and 453849 transitions. [2024-10-10 22:38:00,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:00,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 224 [2024-10-10 22:38:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:01,019 INFO L225 Difference]: With dead ends: 373328 [2024-10-10 22:38:01,020 INFO L226 Difference]: Without dead ends: 211760 [2024-10-10 22:38:01,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:01,151 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 91 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:01,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 172 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:38:01,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211760 states. [2024-10-10 22:38:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211760 to 191633. [2024-10-10 22:38:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191633 states, 191632 states have (on average 1.2211686983384822) internal successors, (234015), 191632 states have internal predecessors, (234015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191633 states to 191633 states and 234015 transitions. [2024-10-10 22:38:04,502 INFO L78 Accepts]: Start accepts. Automaton has 191633 states and 234015 transitions. Word has length 224 [2024-10-10 22:38:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:04,503 INFO L471 AbstractCegarLoop]: Abstraction has 191633 states and 234015 transitions. [2024-10-10 22:38:04,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 191633 states and 234015 transitions. [2024-10-10 22:38:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-10 22:38:04,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:04,519 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:38:04,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:38:04,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 22:38:04,724 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:04,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash -985628968, now seen corresponding path program 1 times [2024-10-10 22:38:04,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:04,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117174811] [2024-10-10 22:38:04,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:04,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:38:05,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117174811] [2024-10-10 22:38:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117174811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:38:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012666017] [2024-10-10 22:38:05,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:05,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:05,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:05,646 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:38:05,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:38:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:05,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:38:05,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:38:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-10 22:38:06,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:38:06,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012666017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:06,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:38:06,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:38:06,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380276553] [2024-10-10 22:38:06,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:06,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:06,002 INFO L87 Difference]: Start difference. First operand 191633 states and 234015 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:07,877 INFO L93 Difference]: Finished difference Result 420034 states and 508418 transitions. [2024-10-10 22:38:07,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:07,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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 254 [2024-10-10 22:38:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:08,353 INFO L225 Difference]: With dead ends: 420034 [2024-10-10 22:38:08,354 INFO L226 Difference]: Without dead ends: 231244 [2024-10-10 22:38:08,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:08,475 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 123 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:08,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 94 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:38:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231244 states. [2024-10-10 22:38:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231244 to 225534. [2024-10-10 22:38:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225534 states, 225533 states have (on average 1.1947519875140222) internal successors, (269456), 225533 states have internal predecessors, (269456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225534 states to 225534 states and 269456 transitions. [2024-10-10 22:38:12,858 INFO L78 Accepts]: Start accepts. Automaton has 225534 states and 269456 transitions. Word has length 254 [2024-10-10 22:38:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:12,859 INFO L471 AbstractCegarLoop]: Abstraction has 225534 states and 269456 transitions. [2024-10-10 22:38:12,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 225534 states and 269456 transitions. [2024-10-10 22:38:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-10-10 22:38:12,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:12,881 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:38:12,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:38:13,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:13,086 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:13,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1628176043, now seen corresponding path program 1 times [2024-10-10 22:38:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624433033] [2024-10-10 22:38:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-10 22:38:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:13,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624433033] [2024-10-10 22:38:13,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624433033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:13,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:13,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:38:13,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209328753] [2024-10-10 22:38:13,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:13,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:38:13,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:13,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:38:13,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:38:13,368 INFO L87 Difference]: Start difference. First operand 225534 states and 269456 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:15,854 INFO L93 Difference]: Finished difference Result 463176 states and 553013 transitions. [2024-10-10 22:38:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:38:15,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 278 [2024-10-10 22:38:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:16,290 INFO L225 Difference]: With dead ends: 463176 [2024-10-10 22:38:16,291 INFO L226 Difference]: Without dead ends: 232162 [2024-10-10 22:38:16,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:38:16,458 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 349 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:16,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 201 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:38:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232162 states.