./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.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 ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:10:11,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:10:11,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:10:11,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:10:11,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:10:11,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:10:11,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:10:11,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:10:11,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:10:11,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:10:11,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:10:11,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:10:11,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:10:11,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:10:11,504 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:10:11,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:10:11,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:10:11,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:10:11,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:10:11,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:10:11,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:10:11,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:10:11,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:10:11,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:10:11,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:10:11,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:10:11,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:10:11,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:10:11,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:10:11,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:10:11,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:10:11,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:10:11,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:10:11,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:10:11,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:10:11,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:10:11,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:10:11,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:10:11,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:10:11,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb [2024-11-10 02:10:11,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:10:11,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:10:11,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:10:11,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:10:11,706 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:10:11,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-10 02:10:13,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:10:13,332 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:10:13,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-10 02:10:13,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe7ee67a/9e08ba8cde4b44b2b337c56f913f7359/FLAG56e5ed390 [2024-11-10 02:10:13,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe7ee67a/9e08ba8cde4b44b2b337c56f913f7359 [2024-11-10 02:10:13,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:10:13,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:10:13,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:10:13,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:10:13,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:10:13,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b23bdc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13, skipping insertion in model container [2024-11-10 02:10:13,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:10:13,515 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.h_Barrel.c[1248,1261] [2024-11-10 02:10:13,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:10:13,707 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:10:13,726 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.h_Barrel.c[1248,1261] [2024-11-10 02:10:13,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:10:13,782 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:10:13,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13 WrapperNode [2024-11-10 02:10:13,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:10:13,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:10:13,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:10:13,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:10:13,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,858 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 549 [2024-11-10 02:10:13,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:10:13,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:10:13,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:10:13,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:10:13,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,900 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 02:10:13,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:10:13,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:10:13,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:10:13,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:10:13,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (1/1) ... [2024-11-10 02:10:13,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:10:13,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:10:13,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:10:13,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:10:14,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:10:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:10:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:10:14,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:10:14,143 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:10:14,145 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:10:14,749 INFO L? ?]: Removed 359 outVars from TransFormulas that were not future-live. [2024-11-10 02:10:14,750 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:10:14,850 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:10:14,851 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:10:14,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:10:14 BoogieIcfgContainer [2024-11-10 02:10:14,851 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:10:14,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:10:14,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:10:14,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:10:14,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:10:13" (1/3) ... [2024-11-10 02:10:14,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cea35ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:10:14, skipping insertion in model container [2024-11-10 02:10:14,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:13" (2/3) ... [2024-11-10 02:10:14,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cea35ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:10:14, skipping insertion in model container [2024-11-10 02:10:14,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:10:14" (3/3) ... [2024-11-10 02:10:14,861 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Barrel.c [2024-11-10 02:10:14,874 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:10:14,875 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:10:14,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:10:14,934 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;@7b0ec710, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:10:14,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:10:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 159 states have (on average 1.4842767295597483) internal successors, (236), 160 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 02:10:14,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:14,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:14,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:14,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1118360973, now seen corresponding path program 1 times [2024-11-10 02:10:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:14,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630625248] [2024-11-10 02:10:14,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:15,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:15,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630625248] [2024-11-10 02:10:15,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630625248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:15,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:16,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297297460] [2024-11-10 02:10:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:16,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:16,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:16,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:16,032 INFO L87 Difference]: Start difference. First operand has 161 states, 159 states have (on average 1.4842767295597483) internal successors, (236), 160 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:16,181 INFO L93 Difference]: Finished difference Result 301 states and 445 transitions. [2024-11-10 02:10:16,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:16,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 02:10:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:16,194 INFO L225 Difference]: With dead ends: 301 [2024-11-10 02:10:16,198 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 02:10:16,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:16,203 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:16,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 02:10:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-10 02:10:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4777070063694266) internal successors, (232), 157 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 232 transitions. [2024-11-10 02:10:16,253 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 232 transitions. Word has length 80 [2024-11-10 02:10:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:16,253 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 232 transitions. [2024-11-10 02:10:16,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 232 transitions. [2024-11-10 02:10:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 02:10:16,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:16,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:16,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:10:16,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:16,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash -164398418, now seen corresponding path program 1 times [2024-11-10 02:10:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896665417] [2024-11-10 02:10:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:16,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896665417] [2024-11-10 02:10:16,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896665417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:16,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:16,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380223924] [2024-11-10 02:10:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:16,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:16,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:16,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:16,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:16,854 INFO L87 Difference]: Start difference. First operand 158 states and 232 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:17,107 INFO L93 Difference]: Finished difference Result 300 states and 441 transitions. [2024-11-10 02:10:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:17,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 02:10:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:17,111 INFO L225 Difference]: With dead ends: 300 [2024-11-10 02:10:17,111 INFO L226 Difference]: Without dead ends: 160 [2024-11-10 02:10:17,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:17,116 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:17,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:10:17,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-10 02:10:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-10 02:10:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.471698113207547) internal successors, (234), 159 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 234 transitions. [2024-11-10 02:10:17,128 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 234 transitions. Word has length 81 [2024-11-10 02:10:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:17,129 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 234 transitions. [2024-11-10 02:10:17,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 234 transitions. [2024-11-10 02:10:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 02:10:17,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:17,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:17,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:10:17,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:17,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1054140104, now seen corresponding path program 1 times [2024-11-10 02:10:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:17,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995354408] [2024-11-10 02:10:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:17,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995354408] [2024-11-10 02:10:17,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995354408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:17,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:17,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:10:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480306448] [2024-11-10 02:10:17,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:17,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:10:17,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:10:17,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:10:17,650 INFO L87 Difference]: Start difference. First operand 160 states and 234 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:17,763 INFO L93 Difference]: Finished difference Result 306 states and 448 transitions. [2024-11-10 02:10:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:10:17,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-10 02:10:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:17,765 INFO L225 Difference]: With dead ends: 306 [2024-11-10 02:10:17,765 INFO L226 Difference]: Without dead ends: 164 [2024-11-10 02:10:17,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:10:17,767 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 163 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:17,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 563 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-10 02:10:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2024-11-10 02:10:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.462962962962963) internal successors, (237), 162 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 237 transitions. [2024-11-10 02:10:17,775 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 237 transitions. Word has length 82 [2024-11-10 02:10:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:17,775 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 237 transitions. [2024-11-10 02:10:17,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 237 transitions. [2024-11-10 02:10:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 02:10:17,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:17,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:17,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:10:17,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:17,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1576027155, now seen corresponding path program 1 times [2024-11-10 02:10:17,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:17,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948637433] [2024-11-10 02:10:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:19,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:19,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948637433] [2024-11-10 02:10:19,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948637433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:19,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325907934] [2024-11-10 02:10:19,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:19,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:19,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:19,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:19,193 INFO L87 Difference]: Start difference. First operand 163 states and 237 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:19,582 INFO L93 Difference]: Finished difference Result 461 states and 671 transitions. [2024-11-10 02:10:19,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:19,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 02:10:19,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:19,585 INFO L225 Difference]: With dead ends: 461 [2024-11-10 02:10:19,585 INFO L226 Difference]: Without dead ends: 316 [2024-11-10 02:10:19,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:19,590 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 643 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:19,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1134 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:10:19,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-10 02:10:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 171. [2024-11-10 02:10:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4529411764705882) internal successors, (247), 170 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 247 transitions. [2024-11-10 02:10:19,604 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 247 transitions. Word has length 83 [2024-11-10 02:10:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:19,604 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 247 transitions. [2024-11-10 02:10:19,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2024-11-10 02:10:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 02:10:19,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:19,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:19,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:10:19,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:19,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:19,606 INFO L85 PathProgramCache]: Analyzing trace with hash 487080552, now seen corresponding path program 1 times [2024-11-10 02:10:19,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:19,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197573783] [2024-11-10 02:10:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:19,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:20,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:20,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197573783] [2024-11-10 02:10:20,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197573783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:20,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:20,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159867471] [2024-11-10 02:10:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:20,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:20,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:20,583 INFO L87 Difference]: Start difference. First operand 171 states and 247 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:20,928 INFO L93 Difference]: Finished difference Result 466 states and 676 transitions. [2024-11-10 02:10:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:20,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-10 02:10:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:20,930 INFO L225 Difference]: With dead ends: 466 [2024-11-10 02:10:20,930 INFO L226 Difference]: Without dead ends: 321 [2024-11-10 02:10:20,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:20,931 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 430 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:20,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1138 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:10:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-10 02:10:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 184. [2024-11-10 02:10:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.4480874316939891) internal successors, (265), 183 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 265 transitions. [2024-11-10 02:10:20,937 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 265 transitions. Word has length 84 [2024-11-10 02:10:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:20,938 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 265 transitions. [2024-11-10 02:10:20,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 265 transitions. [2024-11-10 02:10:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 02:10:20,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:20,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:20,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 02:10:20,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:20,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash 421033547, now seen corresponding path program 1 times [2024-11-10 02:10:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:20,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903857840] [2024-11-10 02:10:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:21,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903857840] [2024-11-10 02:10:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903857840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:21,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906926818] [2024-11-10 02:10:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:21,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:21,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:21,765 INFO L87 Difference]: Start difference. First operand 184 states and 265 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:21,900 INFO L93 Difference]: Finished difference Result 337 states and 487 transitions. [2024-11-10 02:10:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:21,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-10 02:10:21,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:21,901 INFO L225 Difference]: With dead ends: 337 [2024-11-10 02:10:21,902 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 02:10:21,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:21,903 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:21,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 375 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 02:10:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-10 02:10:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.4406779661016949) internal successors, (255), 177 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 255 transitions. [2024-11-10 02:10:21,913 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 255 transitions. Word has length 85 [2024-11-10 02:10:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:21,914 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 255 transitions. [2024-11-10 02:10:21,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:21,914 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 255 transitions. [2024-11-10 02:10:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 02:10:21,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:21,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:21,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 02:10:21,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:21,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1210216934, now seen corresponding path program 1 times [2024-11-10 02:10:21,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:21,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075793371] [2024-11-10 02:10:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:22,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:22,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075793371] [2024-11-10 02:10:22,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075793371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:22,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:22,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:10:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266774470] [2024-11-10 02:10:22,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:22,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:10:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:22,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:10:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:10:22,825 INFO L87 Difference]: Start difference. First operand 178 states and 255 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:23,235 INFO L93 Difference]: Finished difference Result 330 states and 477 transitions. [2024-11-10 02:10:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:10:23,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-10 02:10:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:23,236 INFO L225 Difference]: With dead ends: 330 [2024-11-10 02:10:23,236 INFO L226 Difference]: Without dead ends: 186 [2024-11-10 02:10:23,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:10:23,237 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 3 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:23,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1251 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:10:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-10 02:10:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2024-11-10 02:10:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.4371584699453552) internal successors, (263), 183 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 263 transitions. [2024-11-10 02:10:23,246 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 263 transitions. Word has length 85 [2024-11-10 02:10:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:23,246 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 263 transitions. [2024-11-10 02:10:23,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 263 transitions. [2024-11-10 02:10:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 02:10:23,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:23,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:23,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 02:10:23,247 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:23,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1315577277, now seen corresponding path program 1 times [2024-11-10 02:10:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:23,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465626117] [2024-11-10 02:10:23,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:23,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:24,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:24,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465626117] [2024-11-10 02:10:24,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465626117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:24,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:24,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744198289] [2024-11-10 02:10:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:24,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:24,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:24,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:24,365 INFO L87 Difference]: Start difference. First operand 184 states and 263 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:24,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:24,739 INFO L93 Difference]: Finished difference Result 475 states and 685 transitions. [2024-11-10 02:10:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:24,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-10 02:10:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:24,741 INFO L225 Difference]: With dead ends: 475 [2024-11-10 02:10:24,741 INFO L226 Difference]: Without dead ends: 326 [2024-11-10 02:10:24,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:24,742 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 615 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:24,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1149 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:10:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-10 02:10:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 197. [2024-11-10 02:10:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.433673469387755) internal successors, (281), 196 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-10 02:10:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 281 transitions. [2024-11-10 02:10:24,748 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 281 transitions. Word has length 85 [2024-11-10 02:10:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:24,749 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 281 transitions. [2024-11-10 02:10:24,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 281 transitions. [2024-11-10 02:10:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 02:10:24,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:24,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:24,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 02:10:24,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:24,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash 167254773, now seen corresponding path program 1 times [2024-11-10 02:10:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:24,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350140252] [2024-11-10 02:10:24,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350140252] [2024-11-10 02:10:25,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350140252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:25,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:25,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:25,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006333035] [2024-11-10 02:10:25,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:25,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:25,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:25,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:25,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:25,280 INFO L87 Difference]: Start difference. First operand 197 states and 281 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:25,337 INFO L93 Difference]: Finished difference Result 359 states and 514 transitions. [2024-11-10 02:10:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:25,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-10 02:10:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:25,338 INFO L225 Difference]: With dead ends: 359 [2024-11-10 02:10:25,338 INFO L226 Difference]: Without dead ends: 187 [2024-11-10 02:10:25,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:25,339 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:25,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-10 02:10:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-10 02:10:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.424731182795699) internal successors, (265), 186 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 265 transitions. [2024-11-10 02:10:25,343 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 265 transitions. Word has length 85 [2024-11-10 02:10:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:25,343 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 265 transitions. [2024-11-10 02:10:25,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 265 transitions. [2024-11-10 02:10:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 02:10:25,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:25,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:25,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 02:10:25,344 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:25,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:25,345 INFO L85 PathProgramCache]: Analyzing trace with hash 791642046, now seen corresponding path program 1 times [2024-11-10 02:10:25,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:25,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550118664] [2024-11-10 02:10:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:25,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550118664] [2024-11-10 02:10:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550118664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:25,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116430126] [2024-11-10 02:10:25,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:25,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:25,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:25,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:25,944 INFO L87 Difference]: Start difference. First operand 187 states and 265 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:26,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:26,283 INFO L93 Difference]: Finished difference Result 469 states and 673 transitions. [2024-11-10 02:10:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:26,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-10 02:10:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:26,286 INFO L225 Difference]: With dead ends: 469 [2024-11-10 02:10:26,286 INFO L226 Difference]: Without dead ends: 321 [2024-11-10 02:10:26,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:26,287 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 406 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:26,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1118 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:10:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-10 02:10:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 200. [2024-11-10 02:10:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4221105527638191) internal successors, (283), 199 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-10 02:10:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 283 transitions. [2024-11-10 02:10:26,292 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 283 transitions. Word has length 86 [2024-11-10 02:10:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:26,292 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 283 transitions. [2024-11-10 02:10:26,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2024-11-10 02:10:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 02:10:26,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:26,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:26,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 02:10:26,294 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:26,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:26,294 INFO L85 PathProgramCache]: Analyzing trace with hash 539320479, now seen corresponding path program 1 times [2024-11-10 02:10:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:26,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24241450] [2024-11-10 02:10:26,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:26,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:27,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:27,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24241450] [2024-11-10 02:10:27,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24241450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:27,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:27,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 02:10:27,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710130573] [2024-11-10 02:10:27,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:27,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 02:10:27,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:27,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 02:10:27,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:10:27,066 INFO L87 Difference]: Start difference. First operand 200 states and 283 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:27,373 INFO L93 Difference]: Finished difference Result 374 states and 535 transitions. [2024-11-10 02:10:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 02:10:27,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-10 02:10:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:27,375 INFO L225 Difference]: With dead ends: 374 [2024-11-10 02:10:27,375 INFO L226 Difference]: Without dead ends: 213 [2024-11-10 02:10:27,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:10:27,375 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 6 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:27,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1728 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:10:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-10 02:10:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-11-10 02:10:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4190476190476191) internal successors, (298), 210 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 298 transitions. [2024-11-10 02:10:27,380 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 298 transitions. Word has length 86 [2024-11-10 02:10:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:27,381 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 298 transitions. [2024-11-10 02:10:27,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 298 transitions. [2024-11-10 02:10:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 02:10:27,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:27,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:27,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 02:10:27,382 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:27,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash 796569191, now seen corresponding path program 1 times [2024-11-10 02:10:27,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:27,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663535989] [2024-11-10 02:10:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:27,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:27,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663535989] [2024-11-10 02:10:27,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663535989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:27,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:27,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766609758] [2024-11-10 02:10:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:27,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:27,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:27,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:27,922 INFO L87 Difference]: Start difference. First operand 211 states and 298 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:27,998 INFO L93 Difference]: Finished difference Result 382 states and 543 transitions. [2024-11-10 02:10:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:27,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-10 02:10:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:28,000 INFO L225 Difference]: With dead ends: 382 [2024-11-10 02:10:28,000 INFO L226 Difference]: Without dead ends: 201 [2024-11-10 02:10:28,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:28,000 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:28,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-10 02:10:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-10 02:10:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.41) internal successors, (282), 200 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-10 02:10:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2024-11-10 02:10:28,004 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 86 [2024-11-10 02:10:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:28,005 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2024-11-10 02:10:28,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2024-11-10 02:10:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 02:10:28,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:28,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:28,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 02:10:28,006 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:28,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1628946791, now seen corresponding path program 1 times [2024-11-10 02:10:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230355585] [2024-11-10 02:10:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:28,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:28,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230355585] [2024-11-10 02:10:28,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230355585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:28,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:28,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877022001] [2024-11-10 02:10:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:28,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:28,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:28,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:28,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:28,637 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:28,938 INFO L93 Difference]: Finished difference Result 484 states and 690 transitions. [2024-11-10 02:10:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:28,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-10 02:10:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:28,940 INFO L225 Difference]: With dead ends: 484 [2024-11-10 02:10:28,940 INFO L226 Difference]: Without dead ends: 327 [2024-11-10 02:10:28,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:28,940 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 391 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:28,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1138 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:10:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-10 02:10:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 214. [2024-11-10 02:10:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.408450704225352) internal successors, (300), 213 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 300 transitions. [2024-11-10 02:10:28,944 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 300 transitions. Word has length 87 [2024-11-10 02:10:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:28,944 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 300 transitions. [2024-11-10 02:10:28,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 300 transitions. [2024-11-10 02:10:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 02:10:28,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:28,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:28,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 02:10:28,946 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:28,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:28,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1954316590, now seen corresponding path program 1 times [2024-11-10 02:10:28,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356926366] [2024-11-10 02:10:28,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:30,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:30,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356926366] [2024-11-10 02:10:30,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356926366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:30,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:30,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-10 02:10:30,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228985175] [2024-11-10 02:10:30,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:30,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 02:10:30,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:30,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 02:10:30,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-11-10 02:10:30,362 INFO L87 Difference]: Start difference. First operand 214 states and 300 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:31,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:31,664 INFO L93 Difference]: Finished difference Result 484 states and 693 transitions. [2024-11-10 02:10:31,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 02:10:31,665 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-10 02:10:31,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:31,667 INFO L225 Difference]: With dead ends: 484 [2024-11-10 02:10:31,667 INFO L226 Difference]: Without dead ends: 314 [2024-11-10 02:10:31,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=1885, Unknown=0, NotChecked=0, Total=2070 [2024-11-10 02:10:31,669 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 392 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 2467 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:31,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 2467 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 02:10:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-10 02:10:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 229. [2024-11-10 02:10:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4078947368421053) internal successors, (321), 228 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 321 transitions. [2024-11-10 02:10:31,674 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 321 transitions. Word has length 87 [2024-11-10 02:10:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:31,675 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 321 transitions. [2024-11-10 02:10:31,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 321 transitions. [2024-11-10 02:10:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 02:10:31,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:31,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:31,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 02:10:31,676 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:31,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash 354056351, now seen corresponding path program 1 times [2024-11-10 02:10:31,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:31,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591664378] [2024-11-10 02:10:31,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:32,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:32,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591664378] [2024-11-10 02:10:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591664378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:32,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:32,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:32,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536342318] [2024-11-10 02:10:32,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:32,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:32,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:32,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:32,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:32,485 INFO L87 Difference]: Start difference. First operand 229 states and 321 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:32,876 INFO L93 Difference]: Finished difference Result 420 states and 596 transitions. [2024-11-10 02:10:32,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:10:32,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-10 02:10:32,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:32,877 INFO L225 Difference]: With dead ends: 420 [2024-11-10 02:10:32,881 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 02:10:32,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:32,882 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 3 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:32,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1435 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:10:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 02:10:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-11-10 02:10:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.4017094017094016) internal successors, (328), 234 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 328 transitions. [2024-11-10 02:10:32,891 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 328 transitions. Word has length 87 [2024-11-10 02:10:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:32,891 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 328 transitions. [2024-11-10 02:10:32,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 328 transitions. [2024-11-10 02:10:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 02:10:32,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:32,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:32,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 02:10:32,897 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:32,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -159452396, now seen corresponding path program 1 times [2024-11-10 02:10:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:32,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643646306] [2024-11-10 02:10:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:32,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:34,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:34,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643646306] [2024-11-10 02:10:34,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643646306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:34,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:34,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:34,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829297420] [2024-11-10 02:10:34,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:34,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:34,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:34,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:34,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:34,461 INFO L87 Difference]: Start difference. First operand 235 states and 328 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:34,762 INFO L93 Difference]: Finished difference Result 530 states and 752 transitions. [2024-11-10 02:10:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:34,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-10 02:10:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:34,764 INFO L225 Difference]: With dead ends: 530 [2024-11-10 02:10:34,764 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 02:10:34,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:34,766 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 552 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:34,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1101 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:10:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 02:10:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 248. [2024-11-10 02:10:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.4048582995951417) internal successors, (347), 247 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 347 transitions. [2024-11-10 02:10:34,771 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 347 transitions. Word has length 88 [2024-11-10 02:10:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:34,771 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 347 transitions. [2024-11-10 02:10:34,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 347 transitions. [2024-11-10 02:10:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 02:10:34,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:34,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:34,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 02:10:34,773 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:34,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:34,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1740428840, now seen corresponding path program 1 times [2024-11-10 02:10:34,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:34,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992958109] [2024-11-10 02:10:34,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:34,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:35,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:35,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992958109] [2024-11-10 02:10:35,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992958109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:35,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:35,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 02:10:35,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051443913] [2024-11-10 02:10:35,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:35,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 02:10:35,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:35,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 02:10:35,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-11-10 02:10:35,683 INFO L87 Difference]: Start difference. First operand 248 states and 347 transitions. Second operand has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:36,120 INFO L93 Difference]: Finished difference Result 467 states and 663 transitions. [2024-11-10 02:10:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 02:10:36,121 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-10 02:10:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:36,122 INFO L225 Difference]: With dead ends: 467 [2024-11-10 02:10:36,122 INFO L226 Difference]: Without dead ends: 277 [2024-11-10 02:10:36,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-11-10 02:10:36,123 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 14 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:36,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2402 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:10:36,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-10 02:10:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2024-11-10 02:10:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.405109489051095) internal successors, (385), 274 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 385 transitions. [2024-11-10 02:10:36,126 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 385 transitions. Word has length 88 [2024-11-10 02:10:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:36,127 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 385 transitions. [2024-11-10 02:10:36,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 385 transitions. [2024-11-10 02:10:36,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 02:10:36,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:36,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:36,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 02:10:36,128 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:36,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash -253979723, now seen corresponding path program 1 times [2024-11-10 02:10:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039303349] [2024-11-10 02:10:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:36,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:36,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039303349] [2024-11-10 02:10:36,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039303349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:36,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025037298] [2024-11-10 02:10:36,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:36,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:36,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:36,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:36,475 INFO L87 Difference]: Start difference. First operand 275 states and 385 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:36,551 INFO L93 Difference]: Finished difference Result 496 states and 702 transitions. [2024-11-10 02:10:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:36,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-10 02:10:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:36,554 INFO L225 Difference]: With dead ends: 496 [2024-11-10 02:10:36,554 INFO L226 Difference]: Without dead ends: 272 [2024-11-10 02:10:36,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:36,555 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:36,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-10 02:10:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-11-10 02:10:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.3985239852398523) internal successors, (379), 271 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 379 transitions. [2024-11-10 02:10:36,559 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 379 transitions. Word has length 88 [2024-11-10 02:10:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:36,560 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 379 transitions. [2024-11-10 02:10:36,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 379 transitions. [2024-11-10 02:10:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 02:10:36,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:36,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:36,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 02:10:36,561 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:36,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:36,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1010100046, now seen corresponding path program 1 times [2024-11-10 02:10:36,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:36,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601522350] [2024-11-10 02:10:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:36,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:37,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601522350] [2024-11-10 02:10:37,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601522350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:37,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:37,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:10:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549258473] [2024-11-10 02:10:37,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:37,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:10:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:37,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:10:37,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:10:37,140 INFO L87 Difference]: Start difference. First operand 272 states and 379 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:37,330 INFO L93 Difference]: Finished difference Result 484 states and 683 transitions. [2024-11-10 02:10:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:10:37,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 02:10:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:37,332 INFO L225 Difference]: With dead ends: 484 [2024-11-10 02:10:37,332 INFO L226 Difference]: Without dead ends: 284 [2024-11-10 02:10:37,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:10:37,333 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 3 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:37,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1255 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:10:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-10 02:10:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 279. [2024-11-10 02:10:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.39568345323741) internal successors, (388), 278 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 388 transitions. [2024-11-10 02:10:37,339 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 388 transitions. Word has length 89 [2024-11-10 02:10:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:37,339 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 388 transitions. [2024-11-10 02:10:37,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 388 transitions. [2024-11-10 02:10:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 02:10:37,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:37,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:37,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 02:10:37,341 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:37,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:37,341 INFO L85 PathProgramCache]: Analyzing trace with hash 658297071, now seen corresponding path program 1 times [2024-11-10 02:10:37,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:37,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606116937] [2024-11-10 02:10:37,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:37,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:38,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:38,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606116937] [2024-11-10 02:10:38,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606116937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:38,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:38,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:38,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443935836] [2024-11-10 02:10:38,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:38,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:38,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:38,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:38,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:38,155 INFO L87 Difference]: Start difference. First operand 279 states and 388 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:38,466 INFO L93 Difference]: Finished difference Result 595 states and 840 transitions. [2024-11-10 02:10:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:38,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 02:10:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:38,468 INFO L225 Difference]: With dead ends: 595 [2024-11-10 02:10:38,468 INFO L226 Difference]: Without dead ends: 389 [2024-11-10 02:10:38,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:38,469 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 536 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:38,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1066 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:10:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-10 02:10:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 292. [2024-11-10 02:10:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.395189003436426) internal successors, (406), 291 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 406 transitions. [2024-11-10 02:10:38,478 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 406 transitions. Word has length 89 [2024-11-10 02:10:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:38,479 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 406 transitions. [2024-11-10 02:10:38,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 406 transitions. [2024-11-10 02:10:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 02:10:38,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:38,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:38,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 02:10:38,484 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:38,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:38,485 INFO L85 PathProgramCache]: Analyzing trace with hash 581591518, now seen corresponding path program 1 times [2024-11-10 02:10:38,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:38,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049034657] [2024-11-10 02:10:38,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:39,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:39,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049034657] [2024-11-10 02:10:39,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049034657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:39,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:39,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-10 02:10:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769623673] [2024-11-10 02:10:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:39,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 02:10:39,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:39,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 02:10:39,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2024-11-10 02:10:39,459 INFO L87 Difference]: Start difference. First operand 292 states and 406 transitions. Second operand has 20 states, 20 states have (on average 4.45) internal successors, (89), 20 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:40,182 INFO L93 Difference]: Finished difference Result 532 states and 749 transitions. [2024-11-10 02:10:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 02:10:40,183 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.45) internal successors, (89), 20 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 02:10:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:40,184 INFO L225 Difference]: With dead ends: 532 [2024-11-10 02:10:40,185 INFO L226 Difference]: Without dead ends: 313 [2024-11-10 02:10:40,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2024-11-10 02:10:40,186 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 17 mSDsluCounter, 2737 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:40,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2891 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 02:10:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-10 02:10:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2024-11-10 02:10:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.3928571428571428) internal successors, (429), 308 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 429 transitions. [2024-11-10 02:10:40,197 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 429 transitions. Word has length 89 [2024-11-10 02:10:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:40,197 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 429 transitions. [2024-11-10 02:10:40,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.45) internal successors, (89), 20 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 429 transitions. [2024-11-10 02:10:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 02:10:40,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:40,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:40,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 02:10:40,200 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:40,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:40,200 INFO L85 PathProgramCache]: Analyzing trace with hash 540798510, now seen corresponding path program 1 times [2024-11-10 02:10:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:40,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174773904] [2024-11-10 02:10:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:40,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:40,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174773904] [2024-11-10 02:10:40,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174773904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:40,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:40,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:40,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452837393] [2024-11-10 02:10:40,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:40,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:40,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:40,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:40,675 INFO L87 Difference]: Start difference. First operand 309 states and 429 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:40,743 INFO L93 Difference]: Finished difference Result 552 states and 774 transitions. [2024-11-10 02:10:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:40,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 02:10:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:40,746 INFO L225 Difference]: With dead ends: 552 [2024-11-10 02:10:40,746 INFO L226 Difference]: Without dead ends: 278 [2024-11-10 02:10:40,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:40,747 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:40,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-10 02:10:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 272. [2024-11-10 02:10:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.3874538745387455) internal successors, (376), 271 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 376 transitions. [2024-11-10 02:10:40,755 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 376 transitions. Word has length 89 [2024-11-10 02:10:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:40,755 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 376 transitions. [2024-11-10 02:10:40,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 376 transitions. [2024-11-10 02:10:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 02:10:40,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:40,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:40,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 02:10:40,756 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:40,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1049186527, now seen corresponding path program 1 times [2024-11-10 02:10:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935671655] [2024-11-10 02:10:40,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:40,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:41,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:41,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935671655] [2024-11-10 02:10:41,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935671655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:41,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:41,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:41,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550296262] [2024-11-10 02:10:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:41,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:41,656 INFO L87 Difference]: Start difference. First operand 272 states and 376 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:41,836 INFO L93 Difference]: Finished difference Result 488 states and 685 transitions. [2024-11-10 02:10:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:41,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-10 02:10:41,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:41,839 INFO L225 Difference]: With dead ends: 488 [2024-11-10 02:10:41,840 INFO L226 Difference]: Without dead ends: 284 [2024-11-10 02:10:41,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:41,840 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 3 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:41,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1244 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:10:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-10 02:10:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 279. [2024-11-10 02:10:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 278 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 385 transitions. [2024-11-10 02:10:41,850 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 385 transitions. Word has length 90 [2024-11-10 02:10:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:41,850 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 385 transitions. [2024-11-10 02:10:41,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 385 transitions. [2024-11-10 02:10:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 02:10:41,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:41,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:41,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 02:10:41,852 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:41,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1257020522, now seen corresponding path program 1 times [2024-11-10 02:10:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570055680] [2024-11-10 02:10:41,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:42,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570055680] [2024-11-10 02:10:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570055680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:42,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:42,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:42,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789152698] [2024-11-10 02:10:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:42,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:42,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:42,623 INFO L87 Difference]: Start difference. First operand 279 states and 385 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:42,928 INFO L93 Difference]: Finished difference Result 591 states and 830 transitions. [2024-11-10 02:10:42,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:42,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-10 02:10:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:42,930 INFO L225 Difference]: With dead ends: 591 [2024-11-10 02:10:42,930 INFO L226 Difference]: Without dead ends: 381 [2024-11-10 02:10:42,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:42,932 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 358 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:42,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1044 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:10:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-10 02:10:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 292. [2024-11-10 02:10:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.3848797250859106) internal successors, (403), 291 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 403 transitions. [2024-11-10 02:10:42,939 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 403 transitions. Word has length 90 [2024-11-10 02:10:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:42,939 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 403 transitions. [2024-11-10 02:10:42,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 403 transitions. [2024-11-10 02:10:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 02:10:42,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:42,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:42,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 02:10:42,940 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:42,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:42,941 INFO L85 PathProgramCache]: Analyzing trace with hash -746372969, now seen corresponding path program 1 times [2024-11-10 02:10:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:42,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241833232] [2024-11-10 02:10:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:42,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:44,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241833232] [2024-11-10 02:10:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241833232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:44,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:44,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-10 02:10:44,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185959577] [2024-11-10 02:10:44,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:44,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 02:10:44,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:44,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 02:10:44,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2024-11-10 02:10:44,242 INFO L87 Difference]: Start difference. First operand 292 states and 403 transitions. Second operand has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:45,066 INFO L93 Difference]: Finished difference Result 563 states and 788 transitions. [2024-11-10 02:10:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 02:10:45,067 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-10 02:10:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:45,068 INFO L225 Difference]: With dead ends: 563 [2024-11-10 02:10:45,068 INFO L226 Difference]: Without dead ends: 340 [2024-11-10 02:10:45,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2024-11-10 02:10:45,069 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 21 mSDsluCounter, 3184 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3346 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:45,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3346 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 02:10:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-10 02:10:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 334. [2024-11-10 02:10:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.3873873873873874) internal successors, (462), 333 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 462 transitions. [2024-11-10 02:10:45,083 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 462 transitions. Word has length 90 [2024-11-10 02:10:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:45,083 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 462 transitions. [2024-11-10 02:10:45,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 462 transitions. [2024-11-10 02:10:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 02:10:45,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:45,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:45,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 02:10:45,084 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:45,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:45,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1620070061, now seen corresponding path program 1 times [2024-11-10 02:10:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:45,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241791493] [2024-11-10 02:10:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:45,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:45,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:45,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241791493] [2024-11-10 02:10:45,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241791493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:45,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:45,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:10:45,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66778657] [2024-11-10 02:10:45,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:45,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:10:45,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:45,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:10:45,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:10:45,672 INFO L87 Difference]: Start difference. First operand 334 states and 462 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:45,811 INFO L93 Difference]: Finished difference Result 697 states and 976 transitions. [2024-11-10 02:10:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:10:45,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-10 02:10:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:45,813 INFO L225 Difference]: With dead ends: 697 [2024-11-10 02:10:45,813 INFO L226 Difference]: Without dead ends: 408 [2024-11-10 02:10:45,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:10:45,814 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 352 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:45,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 505 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-10 02:10:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 322. [2024-11-10 02:10:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.3862928348909658) internal successors, (445), 321 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 445 transitions. [2024-11-10 02:10:45,819 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 445 transitions. Word has length 91 [2024-11-10 02:10:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:45,819 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 445 transitions. [2024-11-10 02:10:45,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 445 transitions. [2024-11-10 02:10:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 02:10:45,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:45,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:45,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 02:10:45,820 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:45,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:45,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1006188439, now seen corresponding path program 1 times [2024-11-10 02:10:45,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:45,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174702002] [2024-11-10 02:10:45,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:45,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:46,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174702002] [2024-11-10 02:10:46,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174702002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:46,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:46,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:10:46,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628725082] [2024-11-10 02:10:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:46,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:10:46,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:46,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:10:46,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:10:46,153 INFO L87 Difference]: Start difference. First operand 322 states and 445 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:46,281 INFO L93 Difference]: Finished difference Result 678 states and 950 transitions. [2024-11-10 02:10:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:10:46,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-10 02:10:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:46,283 INFO L225 Difference]: With dead ends: 678 [2024-11-10 02:10:46,283 INFO L226 Difference]: Without dead ends: 408 [2024-11-10 02:10:46,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:10:46,284 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 482 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:46,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 501 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-10 02:10:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 322. [2024-11-10 02:10:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.3831775700934579) internal successors, (444), 321 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 444 transitions. [2024-11-10 02:10:46,289 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 444 transitions. Word has length 91 [2024-11-10 02:10:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:46,289 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 444 transitions. [2024-11-10 02:10:46,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 444 transitions. [2024-11-10 02:10:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 02:10:46,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:46,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:46,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 02:10:46,290 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:46,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1976146245, now seen corresponding path program 1 times [2024-11-10 02:10:46,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:46,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076305532] [2024-11-10 02:10:46,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:46,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:46,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:46,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076305532] [2024-11-10 02:10:46,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076305532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:46,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:46,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:46,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834139629] [2024-11-10 02:10:46,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:46,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:46,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:46,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:46,798 INFO L87 Difference]: Start difference. First operand 322 states and 444 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:47,076 INFO L93 Difference]: Finished difference Result 665 states and 933 transitions. [2024-11-10 02:10:47,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:47,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-10 02:10:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:47,078 INFO L225 Difference]: With dead ends: 665 [2024-11-10 02:10:47,079 INFO L226 Difference]: Without dead ends: 416 [2024-11-10 02:10:47,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:47,081 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 346 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:47,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1034 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:10:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-10 02:10:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 335. [2024-11-10 02:10:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.3832335329341316) internal successors, (462), 334 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2024-11-10 02:10:47,092 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 462 transitions. Word has length 91 [2024-11-10 02:10:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:47,092 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 462 transitions. [2024-11-10 02:10:47,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 462 transitions. [2024-11-10 02:10:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 02:10:47,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:47,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:47,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 02:10:47,093 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:47,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:47,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1198013481, now seen corresponding path program 1 times [2024-11-10 02:10:47,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:47,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978575729] [2024-11-10 02:10:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:48,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:48,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978575729] [2024-11-10 02:10:48,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978575729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:48,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:48,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-10 02:10:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092858818] [2024-11-10 02:10:48,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:48,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 02:10:48,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:48,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 02:10:48,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2024-11-10 02:10:48,259 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:49,194 INFO L93 Difference]: Finished difference Result 631 states and 885 transitions. [2024-11-10 02:10:49,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 02:10:49,194 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-10 02:10:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:49,196 INFO L225 Difference]: With dead ends: 631 [2024-11-10 02:10:49,196 INFO L226 Difference]: Without dead ends: 369 [2024-11-10 02:10:49,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2024-11-10 02:10:49,198 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 25 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:49,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3503 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 02:10:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-10 02:10:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2024-11-10 02:10:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 1.3852459016393444) internal successors, (507), 366 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 507 transitions. [2024-11-10 02:10:49,214 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 507 transitions. Word has length 91 [2024-11-10 02:10:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:49,215 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 507 transitions. [2024-11-10 02:10:49,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 507 transitions. [2024-11-10 02:10:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 02:10:49,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:49,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:49,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 02:10:49,215 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:49,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash 521495447, now seen corresponding path program 1 times [2024-11-10 02:10:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:49,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872288449] [2024-11-10 02:10:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:49,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:49,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872288449] [2024-11-10 02:10:49,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872288449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:49,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:49,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:10:49,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902807910] [2024-11-10 02:10:49,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:49,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:10:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:10:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:10:49,993 INFO L87 Difference]: Start difference. First operand 367 states and 507 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:50,165 INFO L93 Difference]: Finished difference Result 672 states and 942 transitions. [2024-11-10 02:10:50,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:10:50,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-10 02:10:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:50,167 INFO L225 Difference]: With dead ends: 672 [2024-11-10 02:10:50,167 INFO L226 Difference]: Without dead ends: 382 [2024-11-10 02:10:50,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:10:50,168 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 3 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:50,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1242 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:10:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-10 02:10:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2024-11-10 02:10:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.3819628647214854) internal successors, (521), 377 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 521 transitions. [2024-11-10 02:10:50,175 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 521 transitions. Word has length 91 [2024-11-10 02:10:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:50,175 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 521 transitions. [2024-11-10 02:10:50,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 521 transitions. [2024-11-10 02:10:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 02:10:50,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:50,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:50,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 02:10:50,176 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:50,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1082380956, now seen corresponding path program 1 times [2024-11-10 02:10:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:50,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103788942] [2024-11-10 02:10:50,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:50,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:50,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103788942] [2024-11-10 02:10:50,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103788942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:50,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:50,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:50,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80450420] [2024-11-10 02:10:50,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:50,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:50,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:50,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:50,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:50,552 INFO L87 Difference]: Start difference. First operand 378 states and 521 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:50,600 INFO L93 Difference]: Finished difference Result 684 states and 956 transitions. [2024-11-10 02:10:50,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:50,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-10 02:10:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:50,602 INFO L225 Difference]: With dead ends: 684 [2024-11-10 02:10:50,602 INFO L226 Difference]: Without dead ends: 356 [2024-11-10 02:10:50,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:50,603 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:50,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 02:10:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-10 02:10:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350. [2024-11-10 02:10:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.3782234957020056) internal successors, (481), 349 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 481 transitions. [2024-11-10 02:10:50,607 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 481 transitions. Word has length 92 [2024-11-10 02:10:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:50,607 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 481 transitions. [2024-11-10 02:10:50,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 481 transitions. [2024-11-10 02:10:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 02:10:50,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:50,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:50,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 02:10:50,608 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:50,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2106688576, now seen corresponding path program 1 times [2024-11-10 02:10:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:50,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980776820] [2024-11-10 02:10:50,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:50,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:51,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:51,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980776820] [2024-11-10 02:10:51,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980776820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:51,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:51,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:51,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246714500] [2024-11-10 02:10:51,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:51,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:51,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:51,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:51,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:51,249 INFO L87 Difference]: Start difference. First operand 350 states and 481 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:51,484 INFO L93 Difference]: Finished difference Result 708 states and 990 transitions. [2024-11-10 02:10:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:51,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-10 02:10:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:51,486 INFO L225 Difference]: With dead ends: 708 [2024-11-10 02:10:51,486 INFO L226 Difference]: Without dead ends: 436 [2024-11-10 02:10:51,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:51,487 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 332 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:51,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1019 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:10:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-10 02:10:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 363. [2024-11-10 02:10:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 1.3784530386740332) internal successors, (499), 362 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 499 transitions. [2024-11-10 02:10:51,494 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 499 transitions. Word has length 92 [2024-11-10 02:10:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:51,495 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 499 transitions. [2024-11-10 02:10:51,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 499 transitions. [2024-11-10 02:10:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 02:10:51,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:51,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:51,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 02:10:51,496 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:51,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:51,496 INFO L85 PathProgramCache]: Analyzing trace with hash 269477119, now seen corresponding path program 1 times [2024-11-10 02:10:51,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:51,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19081004] [2024-11-10 02:10:51,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:51,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:52,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19081004] [2024-11-10 02:10:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19081004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:52,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:52,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2024-11-10 02:10:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177474936] [2024-11-10 02:10:52,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:52,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 02:10:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 02:10:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2024-11-10 02:10:52,972 INFO L87 Difference]: Start difference. First operand 363 states and 499 transitions. Second operand has 30 states, 30 states have (on average 3.066666666666667) internal successors, (92), 30 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:54,122 INFO L93 Difference]: Finished difference Result 677 states and 944 transitions. [2024-11-10 02:10:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-10 02:10:54,123 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.066666666666667) internal successors, (92), 30 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-10 02:10:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:54,124 INFO L225 Difference]: With dead ends: 677 [2024-11-10 02:10:54,124 INFO L226 Difference]: Without dead ends: 392 [2024-11-10 02:10:54,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2024-11-10 02:10:54,126 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 29 mSDsluCounter, 4210 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4369 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:54,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4369 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 02:10:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-10 02:10:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 383. [2024-11-10 02:10:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.3795811518324608) internal successors, (527), 382 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 527 transitions. [2024-11-10 02:10:54,132 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 527 transitions. Word has length 92 [2024-11-10 02:10:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:54,132 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 527 transitions. [2024-11-10 02:10:54,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.066666666666667) internal successors, (92), 30 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 527 transitions. [2024-11-10 02:10:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 02:10:54,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:54,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:54,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 02:10:54,133 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:54,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:54,133 INFO L85 PathProgramCache]: Analyzing trace with hash 684345517, now seen corresponding path program 1 times [2024-11-10 02:10:54,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:54,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242059639] [2024-11-10 02:10:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242059639] [2024-11-10 02:10:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242059639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:54,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:10:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856572611] [2024-11-10 02:10:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:54,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:10:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:10:54,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:10:54,550 INFO L87 Difference]: Start difference. First operand 383 states and 527 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:54,721 INFO L93 Difference]: Finished difference Result 699 states and 977 transitions. [2024-11-10 02:10:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:10:54,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-10 02:10:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:54,724 INFO L225 Difference]: With dead ends: 699 [2024-11-10 02:10:54,724 INFO L226 Difference]: Without dead ends: 396 [2024-11-10 02:10:54,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:10:54,725 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 3 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1235 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-10 02:10:54,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1235 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:10:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-10 02:10:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 392. [2024-11-10 02:10:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.3759590792838874) internal successors, (538), 391 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 538 transitions. [2024-11-10 02:10:54,730 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 538 transitions. Word has length 92 [2024-11-10 02:10:54,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:54,730 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 538 transitions. [2024-11-10 02:10:54,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 538 transitions. [2024-11-10 02:10:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 02:10:54,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:54,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:54,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 02:10:54,732 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash -40885897, now seen corresponding path program 1 times [2024-11-10 02:10:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383159996] [2024-11-10 02:10:54,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:56,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383159996] [2024-11-10 02:10:56,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383159996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:56,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2024-11-10 02:10:56,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166136421] [2024-11-10 02:10:56,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:56,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 02:10:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:56,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 02:10:56,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2024-11-10 02:10:56,120 INFO L87 Difference]: Start difference. First operand 392 states and 538 transitions. Second operand has 32 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:57,335 INFO L93 Difference]: Finished difference Result 723 states and 1010 transitions. [2024-11-10 02:10:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 02:10:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-10 02:10:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:57,337 INFO L225 Difference]: With dead ends: 723 [2024-11-10 02:10:57,337 INFO L226 Difference]: Without dead ends: 426 [2024-11-10 02:10:57,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2024-11-10 02:10:57,341 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 33 mSDsluCounter, 3813 mSDsCounter, 0 mSdLazyCounter, 2896 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3942 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:57,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3942 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2896 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 02:10:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-10 02:10:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 424. [2024-11-10 02:10:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 1.3782505910165486) internal successors, (583), 423 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 583 transitions. [2024-11-10 02:10:57,346 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 583 transitions. Word has length 93 [2024-11-10 02:10:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:57,347 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 583 transitions. [2024-11-10 02:10:57,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 583 transitions. [2024-11-10 02:10:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 02:10:57,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:57,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:57,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 02:10:57,347 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:57,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:57,348 INFO L85 PathProgramCache]: Analyzing trace with hash 600086427, now seen corresponding path program 1 times [2024-11-10 02:10:57,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:57,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254433550] [2024-11-10 02:10:57,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:57,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254433550] [2024-11-10 02:10:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254433550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:58,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:10:58,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233552064] [2024-11-10 02:10:58,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:58,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:10:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:58,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:10:58,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:10:58,139 INFO L87 Difference]: Start difference. First operand 424 states and 583 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:58,435 INFO L93 Difference]: Finished difference Result 828 states and 1156 transitions. [2024-11-10 02:10:58,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:10:58,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-10 02:10:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:58,437 INFO L225 Difference]: With dead ends: 828 [2024-11-10 02:10:58,437 INFO L226 Difference]: Without dead ends: 502 [2024-11-10 02:10:58,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:10:58,438 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 327 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:58,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1019 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:10:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-10 02:10:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 437. [2024-11-10 02:10:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.378440366972477) internal successors, (601), 436 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 601 transitions. [2024-11-10 02:10:58,445 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 601 transitions. Word has length 93 [2024-11-10 02:10:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:58,445 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 601 transitions. [2024-11-10 02:10:58,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 601 transitions. [2024-11-10 02:10:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 02:10:58,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:58,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:58,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 02:10:58,447 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:58,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:58,447 INFO L85 PathProgramCache]: Analyzing trace with hash 174267462, now seen corresponding path program 1 times [2024-11-10 02:10:58,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:58,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807522791] [2024-11-10 02:10:58,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807522791] [2024-11-10 02:10:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807522791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:58,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:58,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444823054] [2024-11-10 02:10:58,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:58,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:58,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:58,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:58,875 INFO L87 Difference]: Start difference. First operand 437 states and 601 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:58,956 INFO L93 Difference]: Finished difference Result 783 states and 1092 transitions. [2024-11-10 02:10:58,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:58,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-10 02:10:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:58,958 INFO L225 Difference]: With dead ends: 783 [2024-11-10 02:10:58,958 INFO L226 Difference]: Without dead ends: 434 [2024-11-10 02:10:58,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:58,959 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:58,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 543 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-10 02:10:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-11-10 02:10:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 1.374133949191686) internal successors, (595), 433 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 595 transitions. [2024-11-10 02:10:58,964 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 595 transitions. Word has length 93 [2024-11-10 02:10:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:58,964 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 595 transitions. [2024-11-10 02:10:58,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 595 transitions. [2024-11-10 02:10:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 02:10:58,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:58,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:58,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 02:10:58,965 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:58,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1419328303, now seen corresponding path program 1 times [2024-11-10 02:10:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:58,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235179739] [2024-11-10 02:10:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:10:59,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235179739] [2024-11-10 02:10:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235179739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:59,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653726764] [2024-11-10 02:10:59,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:59,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:59,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:59,448 INFO L87 Difference]: Start difference. First operand 434 states and 595 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:59,514 INFO L93 Difference]: Finished difference Result 796 states and 1105 transitions. [2024-11-10 02:10:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:59,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-10 02:10:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:59,515 INFO L225 Difference]: With dead ends: 796 [2024-11-10 02:10:59,516 INFO L226 Difference]: Without dead ends: 417 [2024-11-10 02:10:59,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:59,516 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:59,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:10:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-10 02:10:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2024-11-10 02:10:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.3653846153846154) internal successors, (568), 416 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 568 transitions. [2024-11-10 02:10:59,522 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 568 transitions. Word has length 93 [2024-11-10 02:10:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:59,522 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 568 transitions. [2024-11-10 02:10:59,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:10:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 568 transitions. [2024-11-10 02:10:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 02:10:59,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:59,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:10:59,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 02:10:59,523 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:59,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1895469334, now seen corresponding path program 1 times [2024-11-10 02:10:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563616026] [2024-11-10 02:10:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:00,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:00,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563616026] [2024-11-10 02:11:00,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563616026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:00,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:00,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:11:00,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123935987] [2024-11-10 02:11:00,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:00,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:11:00,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:00,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:11:00,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:11:00,274 INFO L87 Difference]: Start difference. First operand 417 states and 568 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:00,566 INFO L93 Difference]: Finished difference Result 779 states and 1081 transitions. [2024-11-10 02:11:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:11:00,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-10 02:11:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:00,568 INFO L225 Difference]: With dead ends: 779 [2024-11-10 02:11:00,568 INFO L226 Difference]: Without dead ends: 459 [2024-11-10 02:11:00,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:11:00,569 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 351 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:00,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1097 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:11:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-10 02:11:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 430. [2024-11-10 02:11:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.3682983682983683) internal successors, (587), 429 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 587 transitions. [2024-11-10 02:11:00,576 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 587 transitions. Word has length 94 [2024-11-10 02:11:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:00,576 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 587 transitions. [2024-11-10 02:11:00,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 587 transitions. [2024-11-10 02:11:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 02:11:00,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:00,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:00,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 02:11:00,577 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:00,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash 27763625, now seen corresponding path program 1 times [2024-11-10 02:11:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:00,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506173520] [2024-11-10 02:11:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:00,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:02,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:02,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506173520] [2024-11-10 02:11:02,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506173520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:02,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:02,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2024-11-10 02:11:02,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705457221] [2024-11-10 02:11:02,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:02,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-10 02:11:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:02,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-10 02:11:02,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 02:11:02,098 INFO L87 Difference]: Start difference. First operand 430 states and 587 transitions. Second operand has 35 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:03,471 INFO L93 Difference]: Finished difference Result 778 states and 1080 transitions. [2024-11-10 02:11:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-10 02:11:03,472 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-10 02:11:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:03,473 INFO L225 Difference]: With dead ends: 778 [2024-11-10 02:11:03,473 INFO L226 Difference]: Without dead ends: 445 [2024-11-10 02:11:03,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 02:11:03,474 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 34 mSDsluCounter, 3814 mSDsCounter, 0 mSdLazyCounter, 3213 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3935 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:03,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3935 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3213 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 02:11:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-10 02:11:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 443. [2024-11-10 02:11:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.3687782805429864) internal successors, (605), 442 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 605 transitions. [2024-11-10 02:11:03,480 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 605 transitions. Word has length 94 [2024-11-10 02:11:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 605 transitions. [2024-11-10 02:11:03,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 605 transitions. [2024-11-10 02:11:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 02:11:03,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:03,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:03,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-10 02:11:03,482 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:03,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:03,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1785367608, now seen corresponding path program 1 times [2024-11-10 02:11:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432687873] [2024-11-10 02:11:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:03,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:03,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432687873] [2024-11-10 02:11:03,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432687873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:03,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:03,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:11:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659053710] [2024-11-10 02:11:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:03,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:11:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:03,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:11:03,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:11:03,834 INFO L87 Difference]: Start difference. First operand 443 states and 605 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:03,887 INFO L93 Difference]: Finished difference Result 793 states and 1099 transitions. [2024-11-10 02:11:03,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:11:03,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-10 02:11:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:03,889 INFO L225 Difference]: With dead ends: 793 [2024-11-10 02:11:03,889 INFO L226 Difference]: Without dead ends: 440 [2024-11-10 02:11:03,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:11:03,890 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:03,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 537 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 02:11:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-10 02:11:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-10 02:11:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.3644646924829158) internal successors, (599), 439 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 599 transitions. [2024-11-10 02:11:03,894 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 599 transitions. Word has length 94 [2024-11-10 02:11:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:03,894 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 599 transitions. [2024-11-10 02:11:03,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 599 transitions. [2024-11-10 02:11:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 02:11:03,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:03,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:03,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-10 02:11:03,895 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:03,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash -315388798, now seen corresponding path program 1 times [2024-11-10 02:11:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:03,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498548717] [2024-11-10 02:11:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498548717] [2024-11-10 02:11:04,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498548717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:04,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:04,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:11:04,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976715098] [2024-11-10 02:11:04,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:04,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:11:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:04,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:11:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:11:04,536 INFO L87 Difference]: Start difference. First operand 440 states and 599 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:04,680 INFO L93 Difference]: Finished difference Result 847 states and 1165 transitions. [2024-11-10 02:11:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:11:04,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-10 02:11:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:04,682 INFO L225 Difference]: With dead ends: 847 [2024-11-10 02:11:04,682 INFO L226 Difference]: Without dead ends: 467 [2024-11-10 02:11:04,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:11:04,683 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 385 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:04,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 492 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-10 02:11:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 413. [2024-11-10 02:11:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.3592233009708738) internal successors, (560), 412 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 560 transitions. [2024-11-10 02:11:04,689 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 560 transitions. Word has length 94 [2024-11-10 02:11:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:04,689 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 560 transitions. [2024-11-10 02:11:04,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 560 transitions. [2024-11-10 02:11:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 02:11:04,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:04,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:04,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-10 02:11:04,691 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:04,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash 946064369, now seen corresponding path program 1 times [2024-11-10 02:11:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:04,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349641597] [2024-11-10 02:11:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:04,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:05,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349641597] [2024-11-10 02:11:05,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349641597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:05,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:05,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:11:05,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522382772] [2024-11-10 02:11:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:05,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:11:05,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:11:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:11:05,665 INFO L87 Difference]: Start difference. First operand 413 states and 560 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:05,856 INFO L93 Difference]: Finished difference Result 776 states and 1073 transitions. [2024-11-10 02:11:05,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:11:05,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-10 02:11:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:05,858 INFO L225 Difference]: With dead ends: 776 [2024-11-10 02:11:05,858 INFO L226 Difference]: Without dead ends: 447 [2024-11-10 02:11:05,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:11:05,859 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 302 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:05,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 918 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:11:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-10 02:11:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 426. [2024-11-10 02:11:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 1.36) internal successors, (578), 425 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 578 transitions. [2024-11-10 02:11:05,865 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 578 transitions. Word has length 95 [2024-11-10 02:11:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:05,867 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 578 transitions. [2024-11-10 02:11:05,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 578 transitions. [2024-11-10 02:11:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 02:11:05,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:05,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:05,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-10 02:11:05,868 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:05,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:05,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1472055775, now seen corresponding path program 1 times [2024-11-10 02:11:05,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:05,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050434394] [2024-11-10 02:11:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:08,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050434394] [2024-11-10 02:11:08,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050434394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:08,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:08,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2024-11-10 02:11:08,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106356050] [2024-11-10 02:11:08,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:08,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-10 02:11:08,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:08,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-10 02:11:08,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1558, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 02:11:08,274 INFO L87 Difference]: Start difference. First operand 426 states and 578 transitions. Second operand has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 41 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:10,803 INFO L93 Difference]: Finished difference Result 787 states and 1087 transitions. [2024-11-10 02:11:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-10 02:11:10,804 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 41 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-10 02:11:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:10,805 INFO L225 Difference]: With dead ends: 787 [2024-11-10 02:11:10,805 INFO L226 Difference]: Without dead ends: 445 [2024-11-10 02:11:10,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=5735, Unknown=0, NotChecked=0, Total=6006 [2024-11-10 02:11:10,806 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 409 mSDsluCounter, 4745 mSDsCounter, 0 mSdLazyCounter, 3181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 4875 SdHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:10,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 4875 Invalid, 3181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3181 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 02:11:10,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-10 02:11:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 427. [2024-11-10 02:11:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.3591549295774648) internal successors, (579), 426 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 579 transitions. [2024-11-10 02:11:10,821 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 579 transitions. Word has length 95 [2024-11-10 02:11:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:10,821 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 579 transitions. [2024-11-10 02:11:10,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 41 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 579 transitions. [2024-11-10 02:11:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 02:11:10,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:10,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:10,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-10 02:11:10,823 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:10,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1981940270, now seen corresponding path program 1 times [2024-11-10 02:11:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:10,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437409706] [2024-11-10 02:11:10,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:10,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:11,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:11,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437409706] [2024-11-10 02:11:11,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437409706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:11,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:11,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:11:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191920588] [2024-11-10 02:11:11,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:11,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:11:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:11:11,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:11:11,266 INFO L87 Difference]: Start difference. First operand 427 states and 579 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:11,355 INFO L93 Difference]: Finished difference Result 769 states and 1060 transitions. [2024-11-10 02:11:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:11:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-10 02:11:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:11,357 INFO L225 Difference]: With dead ends: 769 [2024-11-10 02:11:11,357 INFO L226 Difference]: Without dead ends: 417 [2024-11-10 02:11:11,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:11:11,357 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:11,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-10 02:11:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2024-11-10 02:11:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.3533653846153846) internal successors, (563), 416 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 563 transitions. [2024-11-10 02:11:11,366 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 563 transitions. Word has length 95 [2024-11-10 02:11:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:11,366 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 563 transitions. [2024-11-10 02:11:11,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 563 transitions. [2024-11-10 02:11:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 02:11:11,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:11,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:11,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-10 02:11:11,367 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:11,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:11,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1753668716, now seen corresponding path program 1 times [2024-11-10 02:11:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:11,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567328327] [2024-11-10 02:11:11,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:11,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:12,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:12,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567328327] [2024-11-10 02:11:12,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567328327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:12,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:12,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:11:12,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396487592] [2024-11-10 02:11:12,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:12,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:11:12,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:12,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:11:12,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:11:12,143 INFO L87 Difference]: Start difference. First operand 417 states and 563 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:12,361 INFO L93 Difference]: Finished difference Result 771 states and 1062 transitions. [2024-11-10 02:11:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:11:12,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 02:11:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:12,362 INFO L225 Difference]: With dead ends: 771 [2024-11-10 02:11:12,362 INFO L226 Difference]: Without dead ends: 443 [2024-11-10 02:11:12,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:11:12,363 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 277 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:12,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1088 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:11:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-10 02:11:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 430. [2024-11-10 02:11:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.3543123543123543) internal successors, (581), 429 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 581 transitions. [2024-11-10 02:11:12,367 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 581 transitions. Word has length 96 [2024-11-10 02:11:12,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:12,368 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 581 transitions. [2024-11-10 02:11:12,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 581 transitions. [2024-11-10 02:11:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 02:11:12,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:12,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:12,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-10 02:11:12,369 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -484857609, now seen corresponding path program 1 times [2024-11-10 02:11:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900995710] [2024-11-10 02:11:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:14,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:14,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900995710] [2024-11-10 02:11:14,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900995710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:14,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:14,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2024-11-10 02:11:14,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865874435] [2024-11-10 02:11:14,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:14,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-10 02:11:14,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:14,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-10 02:11:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 02:11:14,029 INFO L87 Difference]: Start difference. First operand 430 states and 581 transitions. Second operand has 41 states, 41 states have (on average 2.341463414634146) internal successors, (96), 41 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:15,816 INFO L93 Difference]: Finished difference Result 793 states and 1092 transitions. [2024-11-10 02:11:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-10 02:11:15,817 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.341463414634146) internal successors, (96), 41 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 02:11:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:15,819 INFO L225 Difference]: With dead ends: 793 [2024-11-10 02:11:15,819 INFO L226 Difference]: Without dead ends: 452 [2024-11-10 02:11:15,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 02:11:15,821 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 40 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 4187 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4105 SdHoareTripleChecker+Invalid, 4220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:15,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4105 Invalid, 4220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4187 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 02:11:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-10 02:11:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2024-11-10 02:11:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.354120267260579) internal successors, (608), 449 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 608 transitions. [2024-11-10 02:11:15,827 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 608 transitions. Word has length 96 [2024-11-10 02:11:15,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:15,828 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 608 transitions. [2024-11-10 02:11:15,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.341463414634146) internal successors, (96), 41 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 608 transitions. [2024-11-10 02:11:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 02:11:15,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:15,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:15,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-10 02:11:15,829 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:15,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:15,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1221086586, now seen corresponding path program 1 times [2024-11-10 02:11:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:15,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029819712] [2024-11-10 02:11:15,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:15,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:16,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029819712] [2024-11-10 02:11:16,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029819712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:16,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:16,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:11:16,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647866186] [2024-11-10 02:11:16,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:16,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:11:16,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:16,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:11:16,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:11:16,555 INFO L87 Difference]: Start difference. First operand 450 states and 608 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:16,689 INFO L93 Difference]: Finished difference Result 817 states and 1125 transitions. [2024-11-10 02:11:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:11:16,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 02:11:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:16,690 INFO L225 Difference]: With dead ends: 817 [2024-11-10 02:11:16,690 INFO L226 Difference]: Without dead ends: 460 [2024-11-10 02:11:16,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:11:16,691 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 3 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:16,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1203 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-10 02:11:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 456. [2024-11-10 02:11:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.353846153846154) internal successors, (616), 455 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 616 transitions. [2024-11-10 02:11:16,696 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 616 transitions. Word has length 96 [2024-11-10 02:11:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:16,696 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 616 transitions. [2024-11-10 02:11:16,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 616 transitions. [2024-11-10 02:11:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 02:11:16,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:16,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:16,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-10 02:11:16,698 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:16,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 314313944, now seen corresponding path program 1 times [2024-11-10 02:11:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:16,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062829615] [2024-11-10 02:11:16,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:16,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:17,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:17,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062829615] [2024-11-10 02:11:17,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062829615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:17,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:17,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:11:17,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725652686] [2024-11-10 02:11:17,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:17,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:11:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:17,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:11:17,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:11:17,384 INFO L87 Difference]: Start difference. First operand 456 states and 616 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:17,523 INFO L93 Difference]: Finished difference Result 821 states and 1130 transitions. [2024-11-10 02:11:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:11:17,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-10 02:11:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:17,525 INFO L225 Difference]: With dead ends: 821 [2024-11-10 02:11:17,525 INFO L226 Difference]: Without dead ends: 468 [2024-11-10 02:11:17,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:11:17,526 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 3 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:17,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1040 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-10 02:11:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 463. [2024-11-10 02:11:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.352813852813853) internal successors, (625), 462 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 625 transitions. [2024-11-10 02:11:17,532 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 625 transitions. Word has length 97 [2024-11-10 02:11:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:17,532 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 625 transitions. [2024-11-10 02:11:17,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 625 transitions. [2024-11-10 02:11:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 02:11:17,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:17,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:17,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-10 02:11:17,534 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:17,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash 685585991, now seen corresponding path program 1 times [2024-11-10 02:11:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759391133] [2024-11-10 02:11:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:17,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:18,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:18,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759391133] [2024-11-10 02:11:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759391133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:18,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 02:11:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347710970] [2024-11-10 02:11:18,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 02:11:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 02:11:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:11:18,276 INFO L87 Difference]: Start difference. First operand 463 states and 625 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:18,563 INFO L93 Difference]: Finished difference Result 840 states and 1155 transitions. [2024-11-10 02:11:18,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:11:18,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-10 02:11:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:18,565 INFO L225 Difference]: With dead ends: 840 [2024-11-10 02:11:18,565 INFO L226 Difference]: Without dead ends: 481 [2024-11-10 02:11:18,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:11:18,567 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 254 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:18,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1081 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:11:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-10 02:11:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 476. [2024-11-10 02:11:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.3536842105263158) internal successors, (643), 475 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 643 transitions. [2024-11-10 02:11:18,574 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 643 transitions. Word has length 97 [2024-11-10 02:11:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:18,575 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 643 transitions. [2024-11-10 02:11:18,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:18,575 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 643 transitions. [2024-11-10 02:11:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 02:11:18,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:18,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:18,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-10 02:11:18,576 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:18,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:18,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1942263613, now seen corresponding path program 1 times [2024-11-10 02:11:18,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:18,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250945703] [2024-11-10 02:11:18,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:18,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:20,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250945703] [2024-11-10 02:11:20,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250945703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:20,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:20,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2024-11-10 02:11:20,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724916000] [2024-11-10 02:11:20,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:20,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-10 02:11:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:20,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 02:11:20,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 02:11:20,886 INFO L87 Difference]: Start difference. First operand 476 states and 643 transitions. Second operand has 51 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:23,634 INFO L93 Difference]: Finished difference Result 879 states and 1211 transitions. [2024-11-10 02:11:23,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-10 02:11:23,634 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-10 02:11:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:23,636 INFO L225 Difference]: With dead ends: 879 [2024-11-10 02:11:23,636 INFO L226 Difference]: Without dead ends: 520 [2024-11-10 02:11:23,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 02:11:23,640 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 317 mSDsluCounter, 4108 mSDsCounter, 0 mSdLazyCounter, 6140 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 4196 SdHoareTripleChecker+Invalid, 6186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 6140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:23,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 4196 Invalid, 6186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 6140 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 02:11:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-10 02:11:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 516. [2024-11-10 02:11:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.3611650485436892) internal successors, (701), 515 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 701 transitions. [2024-11-10 02:11:23,646 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 701 transitions. Word has length 97 [2024-11-10 02:11:23,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:23,646 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 701 transitions. [2024-11-10 02:11:23,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 701 transitions. [2024-11-10 02:11:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 02:11:23,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:23,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:23,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-10 02:11:23,648 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:23,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash -376591088, now seen corresponding path program 1 times [2024-11-10 02:11:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091052701] [2024-11-10 02:11:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:23,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:25,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:25,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091052701] [2024-11-10 02:11:25,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091052701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:25,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:25,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2024-11-10 02:11:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599103278] [2024-11-10 02:11:25,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:25,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-10 02:11:25,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-10 02:11:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 02:11:25,558 INFO L87 Difference]: Start difference. First operand 516 states and 701 transitions. Second operand has 44 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:27,255 INFO L93 Difference]: Finished difference Result 936 states and 1293 transitions. [2024-11-10 02:11:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-10 02:11:27,256 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-10 02:11:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:27,257 INFO L225 Difference]: With dead ends: 936 [2024-11-10 02:11:27,257 INFO L226 Difference]: Without dead ends: 524 [2024-11-10 02:11:27,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 02:11:27,260 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 45 mSDsluCounter, 4028 mSDsCounter, 0 mSdLazyCounter, 4760 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 4796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:27,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4128 Invalid, 4796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4760 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 02:11:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-10 02:11:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2024-11-10 02:11:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.3594646271510515) internal successors, (711), 523 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 711 transitions. [2024-11-10 02:11:27,265 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 711 transitions. Word has length 97 [2024-11-10 02:11:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:27,269 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 711 transitions. [2024-11-10 02:11:27,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 711 transitions. [2024-11-10 02:11:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 02:11:27,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:27,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:27,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-10 02:11:27,270 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:27,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:27,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1556667383, now seen corresponding path program 1 times [2024-11-10 02:11:27,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:27,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499961132] [2024-11-10 02:11:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:27,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:27,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499961132] [2024-11-10 02:11:27,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499961132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:27,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:27,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:11:27,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774045630] [2024-11-10 02:11:27,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:27,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:11:27,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:27,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:11:27,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:11:27,836 INFO L87 Difference]: Start difference. First operand 524 states and 711 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:27,929 INFO L93 Difference]: Finished difference Result 968 states and 1332 transitions. [2024-11-10 02:11:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:11:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-10 02:11:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:27,932 INFO L225 Difference]: With dead ends: 968 [2024-11-10 02:11:27,932 INFO L226 Difference]: Without dead ends: 526 [2024-11-10 02:11:27,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:11:27,933 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 270 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:27,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 487 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-10 02:11:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2024-11-10 02:11:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.3575525812619502) internal successors, (710), 523 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 710 transitions. [2024-11-10 02:11:27,938 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 710 transitions. Word has length 97 [2024-11-10 02:11:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:27,939 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 710 transitions. [2024-11-10 02:11:27,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 710 transitions. [2024-11-10 02:11:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 02:11:27,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:27,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:27,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-10 02:11:27,940 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:27,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:27,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1617546032, now seen corresponding path program 1 times [2024-11-10 02:11:27,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:27,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841573563] [2024-11-10 02:11:27,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:27,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:11:28,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:28,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841573563] [2024-11-10 02:11:28,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841573563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:28,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:28,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:11:28,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297980551] [2024-11-10 02:11:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:28,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:11:28,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:28,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:11:28,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:11:28,607 INFO L87 Difference]: Start difference. First operand 524 states and 710 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:28,740 INFO L93 Difference]: Finished difference Result 946 states and 1306 transitions. [2024-11-10 02:11:28,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:11:28,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-10 02:11:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:28,742 INFO L225 Difference]: With dead ends: 946 [2024-11-10 02:11:28,742 INFO L226 Difference]: Without dead ends: 544 [2024-11-10 02:11:28,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:11:28,743 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 3 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:28,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1213 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:11:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-10 02:11:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 537. [2024-11-10 02:11:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.3563432835820894) internal successors, (727), 536 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 727 transitions. [2024-11-10 02:11:28,749 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 727 transitions. Word has length 98 [2024-11-10 02:11:28,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:28,750 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 727 transitions. [2024-11-10 02:11:28,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:11:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 727 transitions. [2024-11-10 02:11:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 02:11:28,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:28,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:28,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-10 02:11:28,754 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:28,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash 956915138, now seen corresponding path program 1 times [2024-11-10 02:11:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:28,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64726714] [2024-11-10 02:11:28,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:11:29,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 02:11:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:11:29,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 02:11:29,280 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 02:11:29,281 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 02:11:29,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-10 02:11:29,286 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-10 02:11:29,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 02:11:29,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:11:29 BoogieIcfgContainer [2024-11-10 02:11:29,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 02:11:29,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 02:11:29,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 02:11:29,370 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 02:11:29,371 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:10:14" (3/4) ... [2024-11-10 02:11:29,373 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 02:11:29,374 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 02:11:29,374 INFO L158 Benchmark]: Toolchain (without parser) took 76014.47ms. Allocated memory was 188.7MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 120.9MB in the beginning and 858.1MB in the end (delta: -737.2MB). Peak memory consumption was 854.4MB. Max. memory is 16.1GB. [2024-11-10 02:11:29,374 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 188.7MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:11:29,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.84ms. Allocated memory is still 188.7MB. Free memory was 120.7MB in the beginning and 152.8MB in the end (delta: -32.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-10 02:11:29,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.07ms. Allocated memory is still 188.7MB. Free memory was 152.8MB in the beginning and 139.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 02:11:29,375 INFO L158 Benchmark]: Boogie Preprocessor took 76.22ms. Allocated memory is still 188.7MB. Free memory was 139.2MB in the beginning and 130.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 02:11:29,376 INFO L158 Benchmark]: IcfgBuilder took 915.91ms. Allocated memory is still 188.7MB. Free memory was 130.8MB in the beginning and 145.0MB in the end (delta: -14.2MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2024-11-10 02:11:29,376 INFO L158 Benchmark]: TraceAbstraction took 74516.00ms. Allocated memory was 188.7MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 143.9MB in the beginning and 858.1MB in the end (delta: -714.1MB). Peak memory consumption was 875.5MB. Max. memory is 16.1GB. [2024-11-10 02:11:29,379 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 1.8GB. Free memory is still 858.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:11:29,380 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62ms. Allocated memory is still 188.7MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.84ms. Allocated memory is still 188.7MB. Free memory was 120.7MB in the beginning and 152.8MB in the end (delta: -32.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.07ms. Allocated memory is still 188.7MB. Free memory was 152.8MB in the beginning and 139.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.22ms. Allocated memory is still 188.7MB. Free memory was 139.2MB in the beginning and 130.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 915.91ms. Allocated memory is still 188.7MB. Free memory was 130.8MB in the beginning and 145.0MB in the end (delta: -14.2MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. * TraceAbstraction took 74516.00ms. Allocated memory was 188.7MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 143.9MB in the beginning and 858.1MB in the end (delta: -714.1MB). Peak memory consumption was 875.5MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 1.8GB. Free memory is still 858.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 248. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_1 var_78 = 1; [L35] SORT_1 input_2; [L37] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L37] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L38] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L38] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L39] SORT_3 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, var_4=0, var_78=1] [L40] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_4; [L45] state_8 = init_9_arg_1 [L46] SORT_3 init_26_arg_1 = var_4; [L47] state_25 = init_26_arg_1 [L48] SORT_3 init_44_arg_1 = var_4; [L49] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L52] input_2 = __VERIFIER_nondet_uchar() [L55] SORT_3 var_7_arg_0 = state_5; [L56] SORT_3 var_7_arg_1 = var_4; [L57] SORT_1 var_7 = var_7_arg_0 != var_7_arg_1; [L58] SORT_3 var_10_arg_0 = state_8; [L59] SORT_3 var_10_arg_1 = var_4; [L60] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L61] SORT_1 var_11_arg_0 = var_7; [L62] SORT_1 var_11_arg_1 = var_10; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11_arg_0=0, var_11_arg_1=1, var_4=0, var_78=1] [L63] EXPR var_11_arg_0 | var_11_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L63] SORT_1 var_11 = var_11_arg_0 | var_11_arg_1; [L64] SORT_3 var_12_arg_0 = state_5; [L65] SORT_3 var_12_arg_1 = var_4; [L66] SORT_1 var_12 = var_12_arg_0 != var_12_arg_1; [L67] SORT_3 var_13_arg_0 = state_8; [L68] SORT_3 var_13_arg_1 = var_4; [L69] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L70] SORT_1 var_14_arg_0 = var_12; [L71] SORT_1 var_14_arg_1 = var_13; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11=1, var_14_arg_0=0, var_14_arg_1=1, var_4=0, var_78=1] [L72] EXPR var_14_arg_0 | var_14_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11=1, var_4=0, var_78=1] [L72] SORT_1 var_14 = var_14_arg_0 | var_14_arg_1; [L73] SORT_1 var_15_arg_0 = var_11; [L74] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15_arg_0=1, var_15_arg_1=1, var_4=0, var_78=1] [L75] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L75] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L76] SORT_3 var_16_arg_0 = state_5; [L77] SORT_3 var_16_arg_1 = var_4; [L78] SORT_1 var_16 = var_16_arg_0 != var_16_arg_1; [L79] SORT_3 var_17_arg_0 = state_8; [L80] SORT_3 var_17_arg_1 = var_4; [L81] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L82] SORT_1 var_18_arg_0 = var_16; [L83] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15=1, var_18_arg_0=0, var_18_arg_1=1, var_4=0, var_78=1] [L84] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15=1, var_4=0, var_78=1] [L84] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L85] SORT_1 var_19_arg_0 = var_15; [L86] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_78=1] [L87] EXPR var_19_arg_0 & var_19_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L87] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L88] SORT_3 var_20_arg_0 = state_5; [L89] SORT_3 var_20_arg_1 = var_4; [L90] SORT_1 var_20 = var_20_arg_0 != var_20_arg_1; [L91] SORT_3 var_21_arg_0 = state_8; [L92] SORT_3 var_21_arg_1 = var_4; [L93] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L94] SORT_1 var_22_arg_0 = var_20; [L95] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19=1, var_22_arg_0=0, var_22_arg_1=1, var_4=0, var_78=1] [L96] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19=1, var_4=0, var_78=1] [L96] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L97] SORT_1 var_23_arg_0 = var_19; [L98] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23_arg_0=1, var_23_arg_1=1, var_4=0, var_78=1] [L99] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L99] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L100] SORT_3 var_24_arg_0 = state_8; [L101] SORT_3 var_24_arg_1 = var_4; [L102] SORT_1 var_24 = var_24_arg_0 != var_24_arg_1; [L103] SORT_3 var_27_arg_0 = state_25; [L104] SORT_3 var_27_arg_1 = var_4; [L105] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L106] SORT_1 var_28_arg_0 = var_24; [L107] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23=1, var_28_arg_0=0, var_28_arg_1=1, var_4=0, var_78=1] [L108] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23=1, var_4=0, var_78=1] [L108] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L109] SORT_1 var_29_arg_0 = var_23; [L110] SORT_1 var_29_arg_1 = var_28; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29_arg_0=1, var_29_arg_1=1, var_4=0, var_78=1] [L111] EXPR var_29_arg_0 & var_29_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L111] SORT_1 var_29 = var_29_arg_0 & var_29_arg_1; [L112] SORT_3 var_30_arg_0 = state_8; [L113] SORT_3 var_30_arg_1 = var_4; [L114] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L115] SORT_3 var_31_arg_0 = state_25; [L116] SORT_3 var_31_arg_1 = var_4; [L117] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L118] SORT_1 var_32_arg_0 = var_30; [L119] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29=1, var_32_arg_0=0, var_32_arg_1=1, var_4=0, var_78=1] [L120] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29=1, var_4=0, var_78=1] [L120] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L121] SORT_1 var_33_arg_0 = var_29; [L122] SORT_1 var_33_arg_1 = var_32; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33_arg_0=1, var_33_arg_1=1, var_4=0, var_78=1] [L123] EXPR var_33_arg_0 & var_33_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L123] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L124] SORT_3 var_34_arg_0 = state_8; [L125] SORT_3 var_34_arg_1 = var_4; [L126] SORT_1 var_34 = var_34_arg_0 != var_34_arg_1; [L127] SORT_3 var_35_arg_0 = state_25; [L128] SORT_3 var_35_arg_1 = var_4; [L129] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L130] SORT_1 var_36_arg_0 = var_34; [L131] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33=1, var_36_arg_0=0, var_36_arg_1=1, var_4=0, var_78=1] [L132] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33=1, var_4=0, var_78=1] [L132] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L133] SORT_1 var_37_arg_0 = var_33; [L134] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37_arg_0=1, var_37_arg_1=1, var_4=0, var_78=1] [L135] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L135] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L136] SORT_3 var_38_arg_0 = state_8; [L137] SORT_3 var_38_arg_1 = var_4; [L138] SORT_1 var_38 = var_38_arg_0 != var_38_arg_1; [L139] SORT_3 var_39_arg_0 = state_25; [L140] SORT_3 var_39_arg_1 = var_4; [L141] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L142] SORT_1 var_40_arg_0 = var_38; [L143] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37=1, var_40_arg_0=0, var_40_arg_1=1, var_4=0, var_78=1] [L144] EXPR var_40_arg_0 | var_40_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37=1, var_4=0, var_78=1] [L144] SORT_1 var_40 = var_40_arg_0 | var_40_arg_1; [L145] SORT_1 var_41_arg_0 = var_37; [L146] SORT_1 var_41_arg_1 = var_40; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41_arg_0=1, var_41_arg_1=1, var_4=0, var_78=1] [L147] EXPR var_41_arg_0 & var_41_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L147] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L148] SORT_3 var_42_arg_0 = state_25; [L149] SORT_3 var_42_arg_1 = var_4; [L150] SORT_1 var_42 = var_42_arg_0 != var_42_arg_1; [L151] SORT_3 var_45_arg_0 = state_43; [L152] SORT_3 var_45_arg_1 = var_4; [L153] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L154] SORT_1 var_46_arg_0 = var_42; [L155] SORT_1 var_46_arg_1 = var_45; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41=1, var_46_arg_0=0, var_46_arg_1=1, var_4=0, var_78=1] [L156] EXPR var_46_arg_0 | var_46_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41=1, var_4=0, var_78=1] [L156] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L157] SORT_1 var_47_arg_0 = var_41; [L158] SORT_1 var_47_arg_1 = var_46; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47_arg_0=1, var_47_arg_1=1, var_4=0, var_78=1] [L159] EXPR var_47_arg_0 & var_47_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L159] SORT_1 var_47 = var_47_arg_0 & var_47_arg_1; [L160] SORT_3 var_48_arg_0 = state_25; [L161] SORT_3 var_48_arg_1 = var_4; [L162] SORT_1 var_48 = var_48_arg_0 != var_48_arg_1; [L163] SORT_3 var_49_arg_0 = state_43; [L164] SORT_3 var_49_arg_1 = var_4; [L165] SORT_1 var_49 = var_49_arg_0 == var_49_arg_1; [L166] SORT_1 var_50_arg_0 = var_48; [L167] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47=1, var_4=0, var_50_arg_0=0, var_50_arg_1=1, var_78=1] [L168] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47=1, var_4=0, var_78=1] [L168] SORT_1 var_50 = var_50_arg_0 | var_50_arg_1; [L169] SORT_1 var_51_arg_0 = var_47; [L170] SORT_1 var_51_arg_1 = var_50; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51_arg_0=1, var_51_arg_1=1, var_78=1] [L171] EXPR var_51_arg_0 & var_51_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L171] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L172] SORT_3 var_52_arg_0 = state_25; [L173] SORT_3 var_52_arg_1 = var_4; [L174] SORT_1 var_52 = var_52_arg_0 != var_52_arg_1; [L175] SORT_3 var_53_arg_0 = state_43; [L176] SORT_3 var_53_arg_1 = var_4; [L177] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L178] SORT_1 var_54_arg_0 = var_52; [L179] SORT_1 var_54_arg_1 = var_53; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51=1, var_54_arg_0=0, var_54_arg_1=1, var_78=1] [L180] EXPR var_54_arg_0 | var_54_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51=1, var_78=1] [L180] SORT_1 var_54 = var_54_arg_0 | var_54_arg_1; [L181] SORT_1 var_55_arg_0 = var_51; [L182] SORT_1 var_55_arg_1 = var_54; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55_arg_0=1, var_55_arg_1=1, var_78=1] [L183] EXPR var_55_arg_0 & var_55_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L183] SORT_1 var_55 = var_55_arg_0 & var_55_arg_1; [L184] SORT_3 var_56_arg_0 = state_25; [L185] SORT_3 var_56_arg_1 = var_4; [L186] SORT_1 var_56 = var_56_arg_0 != var_56_arg_1; [L187] SORT_3 var_57_arg_0 = state_43; [L188] SORT_3 var_57_arg_1 = var_4; [L189] SORT_1 var_57 = var_57_arg_0 == var_57_arg_1; [L190] SORT_1 var_58_arg_0 = var_56; [L191] SORT_1 var_58_arg_1 = var_57; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55=1, var_58_arg_0=0, var_58_arg_1=1, var_78=1] [L192] EXPR var_58_arg_0 | var_58_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55=1, var_78=1] [L192] SORT_1 var_58 = var_58_arg_0 | var_58_arg_1; [L193] SORT_1 var_59_arg_0 = var_55; [L194] SORT_1 var_59_arg_1 = var_58; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59_arg_0=1, var_59_arg_1=1, var_78=1] [L195] EXPR var_59_arg_0 & var_59_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L195] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L196] SORT_3 var_60_arg_0 = state_43; [L197] SORT_3 var_60_arg_1 = var_4; [L198] SORT_1 var_60 = var_60_arg_0 != var_60_arg_1; [L199] SORT_3 var_61_arg_0 = state_5; [L200] SORT_3 var_61_arg_1 = var_4; [L201] SORT_1 var_61 = var_61_arg_0 == var_61_arg_1; [L202] SORT_1 var_62_arg_0 = var_60; [L203] SORT_1 var_62_arg_1 = var_61; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59=1, var_62_arg_0=0, var_62_arg_1=1, var_78=1] [L204] EXPR var_62_arg_0 | var_62_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59=1, var_78=1] [L204] SORT_1 var_62 = var_62_arg_0 | var_62_arg_1; [L205] SORT_1 var_63_arg_0 = var_59; [L206] SORT_1 var_63_arg_1 = var_62; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63_arg_0=1, var_63_arg_1=1, var_78=1] [L207] EXPR var_63_arg_0 & var_63_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L207] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L208] SORT_3 var_64_arg_0 = state_43; [L209] SORT_3 var_64_arg_1 = var_4; [L210] SORT_1 var_64 = var_64_arg_0 != var_64_arg_1; [L211] SORT_3 var_65_arg_0 = state_5; [L212] SORT_3 var_65_arg_1 = var_4; [L213] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L214] SORT_1 var_66_arg_0 = var_64; [L215] SORT_1 var_66_arg_1 = var_65; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63=1, var_66_arg_0=0, var_66_arg_1=1, var_78=1] [L216] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63=1, var_78=1] [L216] SORT_1 var_66 = var_66_arg_0 | var_66_arg_1; [L217] SORT_1 var_67_arg_0 = var_63; [L218] SORT_1 var_67_arg_1 = var_66; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67_arg_0=1, var_67_arg_1=1, var_78=1] [L219] EXPR var_67_arg_0 & var_67_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L219] SORT_1 var_67 = var_67_arg_0 & var_67_arg_1; [L220] SORT_3 var_68_arg_0 = state_43; [L221] SORT_3 var_68_arg_1 = var_4; [L222] SORT_1 var_68 = var_68_arg_0 != var_68_arg_1; [L223] SORT_3 var_69_arg_0 = state_5; [L224] SORT_3 var_69_arg_1 = var_4; [L225] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L226] SORT_1 var_70_arg_0 = var_68; [L227] SORT_1 var_70_arg_1 = var_69; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67=1, var_70_arg_0=0, var_70_arg_1=1, var_78=1] [L228] EXPR var_70_arg_0 | var_70_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67=1, var_78=1] [L228] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L229] SORT_1 var_71_arg_0 = var_67; [L230] SORT_1 var_71_arg_1 = var_70; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_71_arg_0=1, var_71_arg_1=1, var_78=1] [L231] EXPR var_71_arg_0 & var_71_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L231] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L232] SORT_3 var_72_arg_0 = state_43; [L233] SORT_3 var_72_arg_1 = var_4; [L234] SORT_1 var_72 = var_72_arg_0 != var_72_arg_1; [L235] SORT_3 var_73_arg_0 = state_5; [L236] SORT_3 var_73_arg_1 = var_4; [L237] SORT_1 var_73 = var_73_arg_0 == var_73_arg_1; [L238] SORT_1 var_74_arg_0 = var_72; [L239] SORT_1 var_74_arg_1 = var_73; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_71=1, var_74_arg_0=0, var_74_arg_1=1, var_78=1] [L240] EXPR var_74_arg_0 | var_74_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_71=1, var_78=1] [L240] SORT_1 var_74 = var_74_arg_0 | var_74_arg_1; [L241] SORT_1 var_75_arg_0 = var_71; [L242] SORT_1 var_75_arg_1 = var_74; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_75_arg_0=1, var_75_arg_1=1, var_78=1] [L243] EXPR var_75_arg_0 & var_75_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L243] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L244] SORT_1 var_79_arg_0 = var_75; [L245] SORT_1 var_79 = ~var_79_arg_0; [L246] SORT_1 var_80_arg_0 = var_78; [L247] SORT_1 var_80_arg_1 = var_79; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1, var_80_arg_0=1, var_80_arg_1=-2] [L248] EXPR var_80_arg_0 & var_80_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L248] SORT_1 var_80 = var_80_arg_0 & var_80_arg_1; [L249] EXPR var_80 & mask_SORT_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L249] var_80 = var_80 & mask_SORT_1 [L250] SORT_1 bad_81_arg_0 = var_80; [L251] CALL __VERIFIER_assert(!(bad_81_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 161 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.4s, OverallIterations: 55, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9181 SdHoareTripleChecker+Valid, 22.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9181 mSDsluCounter, 81387 SdHoareTripleChecker+Invalid, 18.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72484 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45668 IncrementalHoareTripleChecker+Invalid, 45901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 8903 mSDtfsCounter, 45668 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 681 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=537occurred in iteration=54, InterpolantAutomatonStates: 685, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 54 MinimizatonAttempts, 1640 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 8.1s SatisfiabilityAnalysisTime, 38.3s InterpolantComputationTime, 4984 NumberOfCodeBlocks, 4984 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 4832 ConstructedInterpolants, 0 QuantifiedInterpolants, 17155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 54 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 02:11:29,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.h_Barrel.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:11:31,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:11:32,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 02:11:32,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:11:32,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:11:32,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:11:32,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:11:32,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:11:32,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:11:32,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:11:32,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:11:32,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:11:32,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:11:32,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:11:32,088 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:11:32,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:11:32,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:11:32,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:11:32,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:11:32,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:11:32,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:11:32,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 02:11:32,098 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 02:11:32,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:11:32,098 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 02:11:32,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:11:32,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:11:32,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:11:32,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:11:32,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:11:32,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:11:32,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:11:32,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:11:32,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:11:32,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:11:32,102 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 02:11:32,102 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 02:11:32,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:11:32,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:11:32,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:11:32,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:11:32,104 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 -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb [2024-11-10 02:11:32,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:11:32,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:11:32,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:11:32,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:11:32,464 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:11:32,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-10 02:11:34,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:11:34,353 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:11:34,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-10 02:11:34,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f80a85087/8ef8e18edc434fb3a71c0230ea584e03/FLAGc1f70a500 [2024-11-10 02:11:34,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f80a85087/8ef8e18edc434fb3a71c0230ea584e03 [2024-11-10 02:11:34,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:11:34,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:11:34,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:11:34,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:11:34,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:11:34,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:11:34" (1/1) ... [2024-11-10 02:11:34,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d68e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:34, skipping insertion in model container [2024-11-10 02:11:34,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:11:34" (1/1) ... [2024-11-10 02:11:34,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:11:34,645 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.h_Barrel.c[1248,1261] [2024-11-10 02:11:34,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:11:34,769 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:11:34,781 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.h_Barrel.c[1248,1261] [2024-11-10 02:11:34,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:11:34,875 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:11:34,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:34 WrapperNode [2024-11-10 02:11:34,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:11:34,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:11:34,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:11:34,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:11:34,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:34" (1/1) ... [2024-11-10 02:11:34,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:34" (1/1) ... [2024-11-10 02:11:34,927 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 253 [2024-11-10 02:11:34,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:11:34,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:11:34,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:11:34,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:11:34,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:34" (1/1) ... [2024-11-10 02:11:34,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:34" (1/1) ... [2024-11-10 02:11:34,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:34" (1/1) ... [2024-11-10 02:11:34,974 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 02:11:34,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:34" (1/1) ... [2024-11-10 02:11:34,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:34" (1/1) ...