./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c014373e6f19ec2d953a46fddee3dc12cdfbd6e3fd8b2254991c2ccaa9c12571 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:55:24,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:55:24,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:55:24,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:55:24,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:55:24,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:55:24,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:55:24,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:55:24,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:55:24,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:55:24,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:55:24,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:55:24,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:55:24,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:55:24,615 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:55:24,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:55:24,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:55:24,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:55:24,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:55:24,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:55:24,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:55:24,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:55:24,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:55:24,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:55:24,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:55:24,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:55:24,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:55:24,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:55:24,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:55:24,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:55:24,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:55:24,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:55:24,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:55:24,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:55:24,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:55:24,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:55:24,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:55:24,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:55:24,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:55:24,627 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c014373e6f19ec2d953a46fddee3dc12cdfbd6e3fd8b2254991c2ccaa9c12571 [2024-11-12 00:55:24,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:55:24,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:55:24,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:55:24,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:55:24,919 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:55:24,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p1.c [2024-11-12 00:55:26,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:55:26,694 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:55:26,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p1.c [2024-11-12 00:55:26,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8a8fba9/5061817a4775423ea252f243bba5ee34/FLAGda093a3e8 [2024-11-12 00:55:26,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8a8fba9/5061817a4775423ea252f243bba5ee34 [2024-11-12 00:55:26,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:55:26,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:55:26,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:55:26,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:55:26,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:55:26,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:55:26" (1/1) ... [2024-11-12 00:55:26,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2529e73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:26, skipping insertion in model container [2024-11-12 00:55:26,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:55:26" (1/1) ... [2024-11-12 00:55:26,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:55:27,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p1.c[1258,1271] [2024-11-12 00:55:27,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:55:27,773 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:55:27,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p1.c[1258,1271] [2024-11-12 00:55:27,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:55:27,990 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:55:27,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27 WrapperNode [2024-11-12 00:55:27,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:55:27,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:55:27,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:55:27,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:55:27,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:28,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:28,621 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5149 [2024-11-12 00:55:28,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:55:28,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:55:28,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:55:28,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:55:28,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:28,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:28,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:28,949 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:55:28,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:28,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:29,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:29,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:29,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:29,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:29,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:55:29,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:55:29,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:55:29,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:55:29,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (1/1) ... [2024-11-12 00:55:29,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:55:29,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:55:29,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:55:29,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:55:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:55:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:55:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:55:29,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:55:30,017 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:55:30,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:55:34,141 INFO L? ?]: Removed 3314 outVars from TransFormulas that were not future-live. [2024-11-12 00:55:34,141 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:55:34,187 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:55:34,187 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:55:34,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:55:34 BoogieIcfgContainer [2024-11-12 00:55:34,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:55:34,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:55:34,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:55:34,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:55:34,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:55:26" (1/3) ... [2024-11-12 00:55:34,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70068f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:55:34, skipping insertion in model container [2024-11-12 00:55:34,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:27" (2/3) ... [2024-11-12 00:55:34,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70068f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:55:34, skipping insertion in model container [2024-11-12 00:55:34,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:55:34" (3/3) ... [2024-11-12 00:55:34,198 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_bpbs_p1.c [2024-11-12 00:55:34,215 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:55:34,215 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:55:34,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:55:34,323 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;@50828cf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:55:34,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:55:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 1246 states, 1244 states have (on average 1.4991961414790997) internal successors, (1865), 1245 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-12 00:55:34,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:34,360 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:34,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:34,367 INFO L85 PathProgramCache]: Analyzing trace with hash -377916464, now seen corresponding path program 1 times [2024-11-12 00:55:34,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:34,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520931071] [2024-11-12 00:55:34,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:34,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:40,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:40,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520931071] [2024-11-12 00:55:40,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520931071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:40,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:40,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:55:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490334341] [2024-11-12 00:55:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:40,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:55:40,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:55:40,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:55:40,843 INFO L87 Difference]: Start difference. First operand has 1246 states, 1244 states have (on average 1.4991961414790997) internal successors, (1865), 1245 states have internal predecessors, (1865), 0 states have call successors, (0), 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 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:41,468 INFO L93 Difference]: Finished difference Result 2688 states and 4028 transitions. [2024-11-12 00:55:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:55:41,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2024-11-12 00:55:41,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:41,501 INFO L225 Difference]: With dead ends: 2688 [2024-11-12 00:55:41,502 INFO L226 Difference]: Without dead ends: 1576 [2024-11-12 00:55:41,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:55:41,516 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2702 mSDsluCounter, 8988 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2702 SdHoareTripleChecker+Valid, 10789 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:41,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2702 Valid, 10789 Invalid, 376 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 00:55:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-12 00:55:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1385. [2024-11-12 00:55:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1384 states have (on average 1.4971098265895955) internal successors, (2072), 1384 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2072 transitions. [2024-11-12 00:55:41,626 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2072 transitions. Word has length 271 [2024-11-12 00:55:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:41,629 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2072 transitions. [2024-11-12 00:55:41,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2072 transitions. [2024-11-12 00:55:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-12 00:55:41,640 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:41,640 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:41,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:55:41,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:41,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:41,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1741884918, now seen corresponding path program 1 times [2024-11-12 00:55:41,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:41,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022852475] [2024-11-12 00:55:41,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:41,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:43,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:43,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022852475] [2024-11-12 00:55:43,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022852475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:43,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:43,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:55:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532974354] [2024-11-12 00:55:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:43,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:55:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:55:43,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:55:43,061 INFO L87 Difference]: Start difference. First operand 1385 states and 2072 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:43,116 INFO L93 Difference]: Finished difference Result 1389 states and 2076 transitions. [2024-11-12 00:55:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:55:43,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2024-11-12 00:55:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:43,126 INFO L225 Difference]: With dead ends: 1389 [2024-11-12 00:55:43,126 INFO L226 Difference]: Without dead ends: 1387 [2024-11-12 00:55:43,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:55:43,129 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 0 mSDsluCounter, 3712 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5571 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:43,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5571 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-12 00:55:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1387. [2024-11-12 00:55:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1386 states have (on average 1.4963924963924964) internal successors, (2074), 1386 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 2074 transitions. [2024-11-12 00:55:43,154 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 2074 transitions. Word has length 272 [2024-11-12 00:55:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:43,156 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 2074 transitions. [2024-11-12 00:55:43,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2074 transitions. [2024-11-12 00:55:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-12 00:55:43,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:43,160 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:43,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:55:43,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:43,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:43,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1837839272, now seen corresponding path program 1 times [2024-11-12 00:55:43,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:43,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784442059] [2024-11-12 00:55:43,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:43,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:44,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:44,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784442059] [2024-11-12 00:55:44,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784442059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:44,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:44,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:55:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083612935] [2024-11-12 00:55:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:44,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:55:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:44,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:55:44,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:55:44,212 INFO L87 Difference]: Start difference. First operand 1387 states and 2074 transitions. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:44,271 INFO L93 Difference]: Finished difference Result 2500 states and 3740 transitions. [2024-11-12 00:55:44,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:55:44,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2024-11-12 00:55:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:44,279 INFO L225 Difference]: With dead ends: 2500 [2024-11-12 00:55:44,279 INFO L226 Difference]: Without dead ends: 1389 [2024-11-12 00:55:44,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:55:44,282 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 0 mSDsluCounter, 3708 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5567 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:44,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5567 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:55:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-12 00:55:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1389. [2024-11-12 00:55:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1388 states have (on average 1.4956772334293948) internal successors, (2076), 1388 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2076 transitions. [2024-11-12 00:55:44,311 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2076 transitions. Word has length 273 [2024-11-12 00:55:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:44,312 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 2076 transitions. [2024-11-12 00:55:44,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2076 transitions. [2024-11-12 00:55:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-12 00:55:44,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:44,319 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:44,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:55:44,319 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:44,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash 40478371, now seen corresponding path program 1 times [2024-11-12 00:55:44,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:44,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049412999] [2024-11-12 00:55:44,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:44,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:48,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049412999] [2024-11-12 00:55:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049412999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:48,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:48,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:55:48,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470022031] [2024-11-12 00:55:48,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:48,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:55:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:48,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:55:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:55:48,401 INFO L87 Difference]: Start difference. First operand 1389 states and 2076 transitions. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:48,968 INFO L93 Difference]: Finished difference Result 2986 states and 4463 transitions. [2024-11-12 00:55:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:55:48,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2024-11-12 00:55:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:48,976 INFO L225 Difference]: With dead ends: 2986 [2024-11-12 00:55:48,976 INFO L226 Difference]: Without dead ends: 1851 [2024-11-12 00:55:48,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:55:48,979 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2674 mSDsluCounter, 8989 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 10790 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:48,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 10790 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 00:55:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2024-11-12 00:55:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1633. [2024-11-12 00:55:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1632 states have (on average 1.4938725490196079) internal successors, (2438), 1632 states have internal predecessors, (2438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2438 transitions. [2024-11-12 00:55:49,013 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2438 transitions. Word has length 274 [2024-11-12 00:55:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:49,013 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2438 transitions. [2024-11-12 00:55:49,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2438 transitions. [2024-11-12 00:55:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-12 00:55:49,018 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:49,019 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:49,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:55:49,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:49,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash 525572095, now seen corresponding path program 1 times [2024-11-12 00:55:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:49,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327208097] [2024-11-12 00:55:49,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:49,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327208097] [2024-11-12 00:55:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327208097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:52,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:52,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:55:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457502224] [2024-11-12 00:55:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:52,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:55:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:52,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:55:52,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:55:52,745 INFO L87 Difference]: Start difference. First operand 1633 states and 2438 transitions. Second operand has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:53,179 INFO L93 Difference]: Finished difference Result 3466 states and 5175 transitions. [2024-11-12 00:55:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:55:53,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2024-11-12 00:55:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:53,188 INFO L225 Difference]: With dead ends: 3466 [2024-11-12 00:55:53,188 INFO L226 Difference]: Without dead ends: 2343 [2024-11-12 00:55:53,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:55:53,193 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2686 mSDsluCounter, 7194 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2686 SdHoareTripleChecker+Valid, 8995 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:53,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2686 Valid, 8995 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:55:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2024-11-12 00:55:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2137. [2024-11-12 00:55:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2136 states have (on average 1.4915730337078652) internal successors, (3186), 2136 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3186 transitions. [2024-11-12 00:55:53,245 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3186 transitions. Word has length 275 [2024-11-12 00:55:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:53,246 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 3186 transitions. [2024-11-12 00:55:53,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3186 transitions. [2024-11-12 00:55:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-12 00:55:53,252 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:53,253 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:53,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:55:53,253 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:53,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1286159528, now seen corresponding path program 1 times [2024-11-12 00:55:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:53,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309138846] [2024-11-12 00:55:53,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:55:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:55:56,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:55:56,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309138846] [2024-11-12 00:55:56,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309138846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:55:56,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:55:56,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:55:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128980033] [2024-11-12 00:55:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:55:56,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:55:56,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:55:56,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:55:56,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:55:56,315 INFO L87 Difference]: Start difference. First operand 2137 states and 3186 transitions. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:55:56,778 INFO L93 Difference]: Finished difference Result 4437 states and 6617 transitions. [2024-11-12 00:55:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:55:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2024-11-12 00:55:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:55:56,791 INFO L225 Difference]: With dead ends: 4437 [2024-11-12 00:55:56,793 INFO L226 Difference]: Without dead ends: 3324 [2024-11-12 00:55:56,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:55:56,799 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2278 mSDsluCounter, 8990 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2278 SdHoareTripleChecker+Valid, 10791 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 00:55:56,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2278 Valid, 10791 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 00:55:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2024-11-12 00:55:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 3133. [2024-11-12 00:55:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 3132 states have (on average 1.4891443167305236) internal successors, (4664), 3132 states have internal predecessors, (4664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4664 transitions. [2024-11-12 00:55:56,876 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4664 transitions. Word has length 276 [2024-11-12 00:55:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:55:56,877 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4664 transitions. [2024-11-12 00:55:56,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:55:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4664 transitions. [2024-11-12 00:55:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-12 00:55:56,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:55:56,888 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:55:56,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:55:56,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:55:56,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:55:56,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1771577786, now seen corresponding path program 1 times [2024-11-12 00:55:56,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:55:56,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307955386] [2024-11-12 00:55:56,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:55:56,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:55:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:00,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:00,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307955386] [2024-11-12 00:56:00,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307955386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:00,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:00,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 00:56:00,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163761726] [2024-11-12 00:56:00,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:00,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 00:56:00,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:00,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 00:56:00,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:56:00,174 INFO L87 Difference]: Start difference. First operand 3133 states and 4664 transitions. Second operand has 12 states, 12 states have (on average 23.083333333333332) internal successors, (277), 12 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:00,706 INFO L93 Difference]: Finished difference Result 6681 states and 9924 transitions. [2024-11-12 00:56:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 00:56:00,706 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 23.083333333333332) internal successors, (277), 12 states have internal predecessors, (277), 0 states have call successors, (0), 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 277 [2024-11-12 00:56:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:00,724 INFO L225 Difference]: With dead ends: 6681 [2024-11-12 00:56:00,725 INFO L226 Difference]: Without dead ends: 5485 [2024-11-12 00:56:00,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-12 00:56:00,729 INFO L435 NwaCegarLoop]: 1823 mSDtfsCounter, 2724 mSDsluCounter, 14594 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 16417 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:00,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 16417 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:56:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2024-11-12 00:56:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 5049. [2024-11-12 00:56:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5049 states, 5048 states have (on average 1.490095087163233) internal successors, (7522), 5048 states have internal predecessors, (7522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5049 states to 5049 states and 7522 transitions. [2024-11-12 00:56:00,824 INFO L78 Accepts]: Start accepts. Automaton has 5049 states and 7522 transitions. Word has length 277 [2024-11-12 00:56:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:00,825 INFO L471 AbstractCegarLoop]: Abstraction has 5049 states and 7522 transitions. [2024-11-12 00:56:00,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.083333333333332) internal successors, (277), 12 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5049 states and 7522 transitions. [2024-11-12 00:56:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-12 00:56:00,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:00,836 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:00,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:56:00,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:00,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash 427984671, now seen corresponding path program 1 times [2024-11-12 00:56:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:00,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148326330] [2024-11-12 00:56:00,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:00,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:03,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:03,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148326330] [2024-11-12 00:56:03,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148326330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:03,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:03,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:56:03,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222793468] [2024-11-12 00:56:03,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:03,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:56:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:03,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:56:03,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:03,669 INFO L87 Difference]: Start difference. First operand 5049 states and 7522 transitions. Second operand has 8 states, 8 states have (on average 34.625) internal successors, (277), 8 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:04,136 INFO L93 Difference]: Finished difference Result 9441 states and 14059 transitions. [2024-11-12 00:56:04,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:56:04,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.625) internal successors, (277), 8 states have internal predecessors, (277), 0 states have call successors, (0), 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 277 [2024-11-12 00:56:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:04,167 INFO L225 Difference]: With dead ends: 9441 [2024-11-12 00:56:04,167 INFO L226 Difference]: Without dead ends: 8328 [2024-11-12 00:56:04,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:56:04,173 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2265 mSDsluCounter, 8990 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 10791 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:04,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2265 Valid, 10791 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 00:56:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2024-11-12 00:56:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 8137. [2024-11-12 00:56:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8137 states, 8136 states have (on average 1.4879547689282202) internal successors, (12106), 8136 states have internal predecessors, (12106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8137 states to 8137 states and 12106 transitions. [2024-11-12 00:56:04,325 INFO L78 Accepts]: Start accepts. Automaton has 8137 states and 12106 transitions. Word has length 277 [2024-11-12 00:56:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:04,325 INFO L471 AbstractCegarLoop]: Abstraction has 8137 states and 12106 transitions. [2024-11-12 00:56:04,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.625) internal successors, (277), 8 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8137 states and 12106 transitions. [2024-11-12 00:56:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-12 00:56:04,341 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:04,342 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:04,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:56:04,342 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:04,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:04,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1793413138, now seen corresponding path program 1 times [2024-11-12 00:56:04,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:04,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724874879] [2024-11-12 00:56:04,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:04,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:07,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724874879] [2024-11-12 00:56:07,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724874879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:07,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:07,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 00:56:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805885090] [2024-11-12 00:56:07,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:07,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 00:56:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:07,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 00:56:07,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-12 00:56:07,740 INFO L87 Difference]: Start difference. First operand 8137 states and 12106 transitions. Second operand has 14 states, 14 states have (on average 19.857142857142858) internal successors, (278), 14 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:08,468 INFO L93 Difference]: Finished difference Result 10901 states and 16123 transitions. [2024-11-12 00:56:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 00:56:08,469 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.857142857142858) internal successors, (278), 14 states have internal predecessors, (278), 0 states have call successors, (0), 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-11-12 00:56:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:08,487 INFO L225 Difference]: With dead ends: 10901 [2024-11-12 00:56:08,487 INFO L226 Difference]: Without dead ends: 9569 [2024-11-12 00:56:08,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-12 00:56:08,493 INFO L435 NwaCegarLoop]: 2058 mSDtfsCounter, 2893 mSDsluCounter, 19428 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2893 SdHoareTripleChecker+Valid, 21486 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:08,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2893 Valid, 21486 Invalid, 641 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 00:56:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9569 states. [2024-11-12 00:56:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9569 to 8201. [2024-11-12 00:56:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8200 states have (on average 1.4880487804878049) internal successors, (12202), 8200 states have internal predecessors, (12202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 12202 transitions. [2024-11-12 00:56:08,685 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 12202 transitions. Word has length 278 [2024-11-12 00:56:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:08,686 INFO L471 AbstractCegarLoop]: Abstraction has 8201 states and 12202 transitions. [2024-11-12 00:56:08,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.857142857142858) internal successors, (278), 14 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 12202 transitions. [2024-11-12 00:56:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-12 00:56:08,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:08,704 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:08,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 00:56:08,705 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:08,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1199352049, now seen corresponding path program 1 times [2024-11-12 00:56:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706542210] [2024-11-12 00:56:08,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:11,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:11,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706542210] [2024-11-12 00:56:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706542210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:11,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:11,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:56:11,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606891703] [2024-11-12 00:56:11,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:11,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:56:11,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:11,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:56:11,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:11,231 INFO L87 Difference]: Start difference. First operand 8201 states and 12202 transitions. Second operand has 8 states, 8 states have (on average 34.75) internal successors, (278), 8 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:11,628 INFO L93 Difference]: Finished difference Result 10900 states and 16105 transitions. [2024-11-12 00:56:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:56:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.75) internal successors, (278), 8 states have internal predecessors, (278), 0 states have call successors, (0), 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-11-12 00:56:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:11,645 INFO L225 Difference]: With dead ends: 10900 [2024-11-12 00:56:11,645 INFO L226 Difference]: Without dead ends: 8989 [2024-11-12 00:56:11,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:56:11,653 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2278 mSDsluCounter, 8989 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2278 SdHoareTripleChecker+Valid, 10790 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:11,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2278 Valid, 10790 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:56:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2024-11-12 00:56:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 8297. [2024-11-12 00:56:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8297 states, 8296 states have (on average 1.482401157184185) internal successors, (12298), 8296 states have internal predecessors, (12298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 12298 transitions. [2024-11-12 00:56:11,773 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 12298 transitions. Word has length 278 [2024-11-12 00:56:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:11,773 INFO L471 AbstractCegarLoop]: Abstraction has 8297 states and 12298 transitions. [2024-11-12 00:56:11,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.75) internal successors, (278), 8 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 12298 transitions. [2024-11-12 00:56:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-12 00:56:11,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:11,789 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:11,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 00:56:11,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:11,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash -619934265, now seen corresponding path program 1 times [2024-11-12 00:56:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:11,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143498728] [2024-11-12 00:56:11,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:14,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:14,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143498728] [2024-11-12 00:56:14,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143498728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:14,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:14,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:56:14,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653363259] [2024-11-12 00:56:14,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:14,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:56:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:14,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:56:14,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:14,295 INFO L87 Difference]: Start difference. First operand 8297 states and 12298 transitions. Second operand has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:14,703 INFO L93 Difference]: Finished difference Result 15694 states and 23246 transitions. [2024-11-12 00:56:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:56:14,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2024-11-12 00:56:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:14,734 INFO L225 Difference]: With dead ends: 15694 [2024-11-12 00:56:14,734 INFO L226 Difference]: Without dead ends: 14581 [2024-11-12 00:56:14,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:56:14,744 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 2272 mSDsluCounter, 7191 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2272 SdHoareTripleChecker+Valid, 8990 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:14,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2272 Valid, 8990 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:56:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14581 states. [2024-11-12 00:56:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14581 to 14388. [2024-11-12 00:56:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14388 states, 14387 states have (on average 1.4798776673385696) internal successors, (21291), 14387 states have internal predecessors, (21291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14388 states to 14388 states and 21291 transitions. [2024-11-12 00:56:14,993 INFO L78 Accepts]: Start accepts. Automaton has 14388 states and 21291 transitions. Word has length 279 [2024-11-12 00:56:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:14,993 INFO L471 AbstractCegarLoop]: Abstraction has 14388 states and 21291 transitions. [2024-11-12 00:56:14,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 14388 states and 21291 transitions. [2024-11-12 00:56:15,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-12 00:56:15,023 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:15,023 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:15,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 00:56:15,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:15,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:15,024 INFO L85 PathProgramCache]: Analyzing trace with hash -57073743, now seen corresponding path program 1 times [2024-11-12 00:56:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043261291] [2024-11-12 00:56:15,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:15,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:17,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:17,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043261291] [2024-11-12 00:56:17,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043261291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:17,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:17,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:56:17,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713798785] [2024-11-12 00:56:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:17,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:56:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:17,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:56:17,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:17,815 INFO L87 Difference]: Start difference. First operand 14388 states and 21291 transitions. Second operand has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:18,238 INFO L93 Difference]: Finished difference Result 28285 states and 41842 transitions. [2024-11-12 00:56:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:56:18,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 0 states have call successors, (0), 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 280 [2024-11-12 00:56:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:18,288 INFO L225 Difference]: With dead ends: 28285 [2024-11-12 00:56:18,288 INFO L226 Difference]: Without dead ends: 27131 [2024-11-12 00:56:18,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:56:18,304 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2681 mSDsluCounter, 8988 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 10789 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:18,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 10789 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:56:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27131 states. [2024-11-12 00:56:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27131 to 26884. [2024-11-12 00:56:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26884 states, 26883 states have (on average 1.478518022542127) internal successors, (39747), 26883 states have internal predecessors, (39747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26884 states to 26884 states and 39747 transitions. [2024-11-12 00:56:18,723 INFO L78 Accepts]: Start accepts. Automaton has 26884 states and 39747 transitions. Word has length 280 [2024-11-12 00:56:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:18,723 INFO L471 AbstractCegarLoop]: Abstraction has 26884 states and 39747 transitions. [2024-11-12 00:56:18,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 26884 states and 39747 transitions. [2024-11-12 00:56:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-12 00:56:18,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:18,768 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:18,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 00:56:18,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:18,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash -935249753, now seen corresponding path program 1 times [2024-11-12 00:56:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:18,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958142399] [2024-11-12 00:56:18,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:18,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:21,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:21,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958142399] [2024-11-12 00:56:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958142399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:21,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:21,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:56:21,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492750161] [2024-11-12 00:56:21,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:21,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:56:21,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:21,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:56:21,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:21,547 INFO L87 Difference]: Start difference. First operand 26884 states and 39747 transitions. Second operand has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:22,008 INFO L93 Difference]: Finished difference Result 43327 states and 63833 transitions. [2024-11-12 00:56:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:56:22,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 0 states have call successors, (0), 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 281 [2024-11-12 00:56:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:22,075 INFO L225 Difference]: With dead ends: 43327 [2024-11-12 00:56:22,076 INFO L226 Difference]: Without dead ends: 42214 [2024-11-12 00:56:22,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:56:22,099 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2733 mSDsluCounter, 8988 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 10789 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:22,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 10789 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:56:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42214 states. [2024-11-12 00:56:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42214 to 42023. [2024-11-12 00:56:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42023 states, 42022 states have (on average 1.4725619913378707) internal successors, (61880), 42022 states have internal predecessors, (61880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42023 states to 42023 states and 61880 transitions. [2024-11-12 00:56:22,649 INFO L78 Accepts]: Start accepts. Automaton has 42023 states and 61880 transitions. Word has length 281 [2024-11-12 00:56:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:22,649 INFO L471 AbstractCegarLoop]: Abstraction has 42023 states and 61880 transitions. [2024-11-12 00:56:22,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 42023 states and 61880 transitions. [2024-11-12 00:56:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-12 00:56:22,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:22,708 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:22,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 00:56:22,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:22,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash -50966616, now seen corresponding path program 1 times [2024-11-12 00:56:22,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:22,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923737357] [2024-11-12 00:56:22,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:22,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:25,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923737357] [2024-11-12 00:56:25,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923737357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:25,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:56:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169137003] [2024-11-12 00:56:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:25,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:56:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:56:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:25,216 INFO L87 Difference]: Start difference. First operand 42023 states and 61880 transitions. Second operand has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:25,724 INFO L93 Difference]: Finished difference Result 74630 states and 109635 transitions. [2024-11-12 00:56:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:56:25,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 0 states have call successors, (0), 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 282 [2024-11-12 00:56:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:25,826 INFO L225 Difference]: With dead ends: 74630 [2024-11-12 00:56:25,826 INFO L226 Difference]: Without dead ends: 73507 [2024-11-12 00:56:25,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:56:25,859 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2267 mSDsluCounter, 7195 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2267 SdHoareTripleChecker+Valid, 8996 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:25,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2267 Valid, 8996 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73507 states. [2024-11-12 00:56:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73507 to 73301. [2024-11-12 00:56:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73301 states, 73300 states have (on average 1.4685675306957708) internal successors, (107646), 73300 states have internal predecessors, (107646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73301 states to 73301 states and 107646 transitions. [2024-11-12 00:56:26,930 INFO L78 Accepts]: Start accepts. Automaton has 73301 states and 107646 transitions. Word has length 282 [2024-11-12 00:56:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:26,931 INFO L471 AbstractCegarLoop]: Abstraction has 73301 states and 107646 transitions. [2024-11-12 00:56:26,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 73301 states and 107646 transitions. [2024-11-12 00:56:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-12 00:56:27,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:27,026 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:27,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 00:56:27,026 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:27,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:27,027 INFO L85 PathProgramCache]: Analyzing trace with hash -52780526, now seen corresponding path program 1 times [2024-11-12 00:56:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:27,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631172073] [2024-11-12 00:56:27,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:27,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631172073] [2024-11-12 00:56:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631172073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:29,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:29,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:56:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813694759] [2024-11-12 00:56:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:29,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:56:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:29,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:56:29,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:29,990 INFO L87 Difference]: Start difference. First operand 73301 states and 107646 transitions. Second operand has 8 states, 8 states have (on average 35.375) internal successors, (283), 8 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:30,674 INFO L93 Difference]: Finished difference Result 139284 states and 204311 transitions. [2024-11-12 00:56:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:56:30,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.375) internal successors, (283), 8 states have internal predecessors, (283), 0 states have call successors, (0), 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 283 [2024-11-12 00:56:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:30,918 INFO L225 Difference]: With dead ends: 139284 [2024-11-12 00:56:30,918 INFO L226 Difference]: Without dead ends: 138093 [2024-11-12 00:56:30,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:56:31,198 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 2691 mSDsluCounter, 7194 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2691 SdHoareTripleChecker+Valid, 8995 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:31,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2691 Valid, 8995 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138093 states.