./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 42bba35470723c3ed0bb104994d7663c79c9e18425de9896b18a2c3627effd61 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:00:47,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:00:47,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 01:00:47,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:00:47,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:00:47,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:00:47,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:00:47,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:00:47,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:00:47,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:00:47,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:00:47,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:00:47,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:00:47,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:00:47,985 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:00:47,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:00:47,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:00:47,986 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 01:00:47,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:00:47,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 01:00:47,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:00:47,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:00:47,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:00:47,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:00:47,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:00:47,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 01:00:47,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:00:47,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:00:47,990 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:00:47,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:00:47,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:00:47,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:00:47,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:00:47,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:00:47,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:00:47,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:00:47,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:00:47,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:00:47,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:00:47,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:00:47,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:00:47,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:00:47,995 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42bba35470723c3ed0bb104994d7663c79c9e18425de9896b18a2c3627effd61 [2024-11-10 01:00:48,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:00:48,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:00:48,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:00:48,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:00:48,316 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:00:48,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c [2024-11-10 01:00:49,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:00:50,195 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:00:50,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c [2024-11-10 01:00:50,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83319ac97/115934da7aa141ecac31d830f6313fc3/FLAG3dec5aae4 [2024-11-10 01:00:50,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83319ac97/115934da7aa141ecac31d830f6313fc3 [2024-11-10 01:00:50,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:00:50,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:00:50,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:00:50,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:00:50,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:00:50,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:50" (1/1) ... [2024-11-10 01:00:50,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a76bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50, skipping insertion in model container [2024-11-10 01:00:50,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:50" (1/1) ... [2024-11-10 01:00:50,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:00:50,896 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/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c[20426,20439] [2024-11-10 01:00:50,971 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/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c[27362,27375] [2024-11-10 01:00:51,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:00:51,661 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:00:51,711 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/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c[20426,20439] [2024-11-10 01:00:51,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/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c[27362,27375] [2024-11-10 01:00:52,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:00:52,136 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:00:52,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52 WrapperNode [2024-11-10 01:00:52,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:00:52,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:00:52,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:00:52,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:00:52,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:52,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:52,546 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5219 [2024-11-10 01:00:52,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:00:52,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:00:52,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:00:52,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:00:52,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:52,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:52,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:52,858 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 01:00:52,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:52,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:52,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:53,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:53,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:53,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:53,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:00:53,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:00:53,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:00:53,111 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:00:53,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (1/1) ... [2024-11-10 01:00:53,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:00:53,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:00:53,152 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 01:00:53,154 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 01:00:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:00:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:00:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:00:53,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:00:53,411 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:00:53,414 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:00:59,304 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc calculate_output_#t~ret46#1; [2024-11-10 01:00:59,305 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3764: havoc calculate_output2_#t~ret47#1; [2024-11-10 01:00:59,305 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5254: havoc calculate_output3_#t~ret48#1; [2024-11-10 01:00:59,552 INFO L? ?]: Removed 2091 outVars from TransFormulas that were not future-live. [2024-11-10 01:00:59,553 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:00:59,596 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:00:59,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:00:59,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:00:59 BoogieIcfgContainer [2024-11-10 01:00:59,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:00:59,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:00:59,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:00:59,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:00:59,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:00:50" (1/3) ... [2024-11-10 01:00:59,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a49e37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:00:59, skipping insertion in model container [2024-11-10 01:00:59,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:52" (2/3) ... [2024-11-10 01:00:59,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a49e37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:00:59, skipping insertion in model container [2024-11-10 01:00:59,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:00:59" (3/3) ... [2024-11-10 01:00:59,606 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c [2024-11-10 01:00:59,621 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:00:59,622 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 01:00:59,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:00:59,719 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;@1590dffb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:00:59,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 01:00:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 937 states, 934 states have (on average 2.6252676659528906) internal successors, (2452), 936 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 01:00:59,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:59,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:59,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:59,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash -685889018, now seen corresponding path program 1 times [2024-11-10 01:00:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:59,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023972544] [2024-11-10 01:00:59,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:59,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:00,060 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 01:01:00,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023972544] [2024-11-10 01:01:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023972544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:00,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:00,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:01:00,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118352074] [2024-11-10 01:01:00,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:00,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:01:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:00,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:01:00,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:01:00,091 INFO L87 Difference]: Start difference. First operand has 937 states, 934 states have (on average 2.6252676659528906) internal successors, (2452), 936 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:00,205 INFO L93 Difference]: Finished difference Result 1816 states and 4794 transitions. [2024-11-10 01:01:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:01:00,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 01:01:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:00,228 INFO L225 Difference]: With dead ends: 1816 [2024-11-10 01:01:00,229 INFO L226 Difference]: Without dead ends: 869 [2024-11-10 01:01:00,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:01:00,239 INFO L432 NwaCegarLoop]: 2384 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:00,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-10 01:01:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2024-11-10 01:01:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 867 states have (on average 2.6724336793540946) internal successors, (2317), 868 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2317 transitions. [2024-11-10 01:01:00,338 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2317 transitions. Word has length 30 [2024-11-10 01:01:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:00,338 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 2317 transitions. [2024-11-10 01:01:00,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2317 transitions. [2024-11-10 01:01:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 01:01:00,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:00,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] [2024-11-10 01:01:00,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:01:00,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:00,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash -752895771, now seen corresponding path program 1 times [2024-11-10 01:01:00,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:00,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141262578] [2024-11-10 01:01:00,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:00,621 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 01:01:00,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:00,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141262578] [2024-11-10 01:01:00,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141262578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:00,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:00,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:01:00,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421644506] [2024-11-10 01:01:00,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:00,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:01:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:00,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:01:00,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:01:00,628 INFO L87 Difference]: Start difference. First operand 869 states and 2317 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:00,812 INFO L93 Difference]: Finished difference Result 930 states and 2411 transitions. [2024-11-10 01:01:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:01:00,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 01:01:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:00,817 INFO L225 Difference]: With dead ends: 930 [2024-11-10 01:01:00,817 INFO L226 Difference]: Without dead ends: 869 [2024-11-10 01:01:00,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:01:00,820 INFO L432 NwaCegarLoop]: 2315 mSDtfsCounter, 0 mSDsluCounter, 6890 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9205 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:00,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9205 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:00,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-10 01:01:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2024-11-10 01:01:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 867 states have (on average 2.6147635524798156) internal successors, (2267), 868 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2267 transitions. [2024-11-10 01:01:00,844 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2267 transitions. Word has length 30 [2024-11-10 01:01:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:00,844 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 2267 transitions. [2024-11-10 01:01:00,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2267 transitions. [2024-11-10 01:01:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 01:01:00,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:00,847 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] [2024-11-10 01:01:00,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:01:00,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:00,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2102116487, now seen corresponding path program 1 times [2024-11-10 01:01:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:00,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391866140] [2024-11-10 01:01:00,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:00,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:01,158 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 01:01:01,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391866140] [2024-11-10 01:01:01,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391866140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:01,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:01,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:01,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556064135] [2024-11-10 01:01:01,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:01,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:01:01,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:01,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:01:01,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:01:01,165 INFO L87 Difference]: Start difference. First operand 869 states and 2267 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:09,150 INFO L93 Difference]: Finished difference Result 3128 states and 8620 transitions. [2024-11-10 01:01:09,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:01:09,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-10 01:01:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:09,163 INFO L225 Difference]: With dead ends: 3128 [2024-11-10 01:01:09,164 INFO L226 Difference]: Without dead ends: 2373 [2024-11-10 01:01:09,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:01:09,167 INFO L432 NwaCegarLoop]: 841 mSDtfsCounter, 4515 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8238 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4515 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 9338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 8238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:09,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4515 Valid, 864 Invalid, 9338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 8238 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-10 01:01:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2024-11-10 01:01:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2373. [2024-11-10 01:01:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 2371 states have (on average 2.42724588781105) internal successors, (5755), 2372 states have internal predecessors, (5755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 5755 transitions. [2024-11-10 01:01:09,240 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 5755 transitions. Word has length 62 [2024-11-10 01:01:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:09,241 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 5755 transitions. [2024-11-10 01:01:09,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 5755 transitions. [2024-11-10 01:01:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 01:01:09,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:09,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:09,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:01:09,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:09,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1903427819, now seen corresponding path program 1 times [2024-11-10 01:01:09,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:09,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869394932] [2024-11-10 01:01:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:09,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:09,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 01:01:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869394932] [2024-11-10 01:01:09,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869394932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:09,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:09,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:09,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470371916] [2024-11-10 01:01:09,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:09,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:09,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:09,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:09,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:09,585 INFO L87 Difference]: Start difference. First operand 2373 states and 5755 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:10,065 INFO L93 Difference]: Finished difference Result 3171 states and 7015 transitions. [2024-11-10 01:01:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 01:01:10,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-10 01:01:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:10,082 INFO L225 Difference]: With dead ends: 3171 [2024-11-10 01:01:10,083 INFO L226 Difference]: Without dead ends: 3114 [2024-11-10 01:01:10,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-10 01:01:10,089 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 16322 mSDsluCounter, 3401 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16322 SdHoareTripleChecker+Valid, 5664 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:10,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16322 Valid, 5664 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:01:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2024-11-10 01:01:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2427. [2024-11-10 01:01:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2425 states have (on average 2.408659793814433) internal successors, (5841), 2426 states have internal predecessors, (5841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 5841 transitions. [2024-11-10 01:01:10,186 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 5841 transitions. Word has length 79 [2024-11-10 01:01:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:10,188 INFO L471 AbstractCegarLoop]: Abstraction has 2427 states and 5841 transitions. [2024-11-10 01:01:10,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:10,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 5841 transitions. [2024-11-10 01:01:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 01:01:10,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:10,194 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 01:01:10,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:01:10,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:10,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:10,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1827426509, now seen corresponding path program 1 times [2024-11-10 01:01:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:10,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364810000] [2024-11-10 01:01:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:10,708 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 01:01:10,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:10,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364810000] [2024-11-10 01:01:10,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364810000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:10,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:10,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:10,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886034323] [2024-11-10 01:01:10,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:10,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:10,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:10,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:10,715 INFO L87 Difference]: Start difference. First operand 2427 states and 5841 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 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 01:01:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:11,119 INFO L93 Difference]: Finished difference Result 2541 states and 6019 transitions. [2024-11-10 01:01:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:11,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 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 01:01:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:11,134 INFO L225 Difference]: With dead ends: 2541 [2024-11-10 01:01:11,134 INFO L226 Difference]: Without dead ends: 2430 [2024-11-10 01:01:11,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-10 01:01:11,140 INFO L432 NwaCegarLoop]: 2258 mSDtfsCounter, 13158 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13158 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:11,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13158 Valid, 2783 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2024-11-10 01:01:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2427. [2024-11-10 01:01:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2425 states have (on average 2.4082474226804123) internal successors, (5840), 2426 states have internal predecessors, (5840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 5840 transitions. [2024-11-10 01:01:11,209 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 5840 transitions. Word has length 81 [2024-11-10 01:01:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:11,210 INFO L471 AbstractCegarLoop]: Abstraction has 2427 states and 5840 transitions. [2024-11-10 01:01:11,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 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 01:01:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 5840 transitions. [2024-11-10 01:01:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 01:01:11,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:11,212 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 01:01:11,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:01:11,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:11,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:11,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1755501160, now seen corresponding path program 1 times [2024-11-10 01:01:11,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:11,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119973533] [2024-11-10 01:01:11,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:11,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:11,309 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 01:01:11,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:11,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119973533] [2024-11-10 01:01:11,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119973533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:11,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:11,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:11,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394493718] [2024-11-10 01:01:11,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:11,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:11,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:11,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:11,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:11,313 INFO L87 Difference]: Start difference. First operand 2427 states and 5840 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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 01:01:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:11,361 INFO L93 Difference]: Finished difference Result 2637 states and 6170 transitions. [2024-11-10 01:01:11,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:11,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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 01:01:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:11,374 INFO L225 Difference]: With dead ends: 2637 [2024-11-10 01:01:11,374 INFO L226 Difference]: Without dead ends: 2526 [2024-11-10 01:01:11,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:11,377 INFO L432 NwaCegarLoop]: 2273 mSDtfsCounter, 2182 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:11,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 2358 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2024-11-10 01:01:11,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2523. [2024-11-10 01:01:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2521 states have (on average 2.376041253470845) internal successors, (5990), 2522 states have internal predecessors, (5990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 5990 transitions. [2024-11-10 01:01:11,448 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 5990 transitions. Word has length 82 [2024-11-10 01:01:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:11,449 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 5990 transitions. [2024-11-10 01:01:11,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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 01:01:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 5990 transitions. [2024-11-10 01:01:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:11,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:11,451 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 01:01:11,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:01:11,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:11,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1519393231, now seen corresponding path program 1 times [2024-11-10 01:01:11,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:11,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412527178] [2024-11-10 01:01:11,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:11,522 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 01:01:11,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:11,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412527178] [2024-11-10 01:01:11,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412527178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:11,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:11,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:11,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019276470] [2024-11-10 01:01:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:11,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:11,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:11,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:11,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:11,525 INFO L87 Difference]: Start difference. First operand 2523 states and 5990 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:11,605 INFO L93 Difference]: Finished difference Result 2740 states and 6330 transitions. [2024-11-10 01:01:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:11,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:11,617 INFO L225 Difference]: With dead ends: 2740 [2024-11-10 01:01:11,617 INFO L226 Difference]: Without dead ends: 2629 [2024-11-10 01:01:11,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:11,619 INFO L432 NwaCegarLoop]: 2341 mSDtfsCounter, 2200 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:11,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 2432 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2024-11-10 01:01:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2626. [2024-11-10 01:01:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2624 states have (on average 2.34375) internal successors, (6150), 2625 states have internal predecessors, (6150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 6150 transitions. [2024-11-10 01:01:11,682 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 6150 transitions. Word has length 83 [2024-11-10 01:01:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:11,682 INFO L471 AbstractCegarLoop]: Abstraction has 2626 states and 6150 transitions. [2024-11-10 01:01:11,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 6150 transitions. [2024-11-10 01:01:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:11,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:11,684 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 01:01:11,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:01:11,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:11,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1667474161, now seen corresponding path program 1 times [2024-11-10 01:01:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618987458] [2024-11-10 01:01:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:11,756 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 01:01:11,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:11,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618987458] [2024-11-10 01:01:11,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618987458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:11,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:11,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:11,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920227334] [2024-11-10 01:01:11,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:11,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:11,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:11,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:11,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:11,759 INFO L87 Difference]: Start difference. First operand 2626 states and 6150 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:11,799 INFO L93 Difference]: Finished difference Result 3216 states and 7072 transitions. [2024-11-10 01:01:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:11,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:11,817 INFO L225 Difference]: With dead ends: 3216 [2024-11-10 01:01:11,817 INFO L226 Difference]: Without dead ends: 2909 [2024-11-10 01:01:11,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:11,820 INFO L432 NwaCegarLoop]: 2343 mSDtfsCounter, 2198 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:11,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 2438 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2024-11-10 01:01:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2906. [2024-11-10 01:01:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2904 states have (on average 2.2665289256198347) internal successors, (6582), 2905 states have internal predecessors, (6582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 6582 transitions. [2024-11-10 01:01:11,894 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 6582 transitions. Word has length 83 [2024-11-10 01:01:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:11,894 INFO L471 AbstractCegarLoop]: Abstraction has 2906 states and 6582 transitions. [2024-11-10 01:01:11,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 6582 transitions. [2024-11-10 01:01:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:11,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:11,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] [2024-11-10 01:01:11,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:01:11,896 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:11,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1854952335, now seen corresponding path program 1 times [2024-11-10 01:01:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968454326] [2024-11-10 01:01:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:11,965 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 01:01:11,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:11,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968454326] [2024-11-10 01:01:11,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968454326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:11,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:11,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:11,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084896406] [2024-11-10 01:01:11,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:11,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:11,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:11,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:11,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:11,971 INFO L87 Difference]: Start difference. First operand 2906 states and 6582 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:12,019 INFO L93 Difference]: Finished difference Result 4032 states and 8326 transitions. [2024-11-10 01:01:12,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:12,038 INFO L225 Difference]: With dead ends: 4032 [2024-11-10 01:01:12,039 INFO L226 Difference]: Without dead ends: 3445 [2024-11-10 01:01:12,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:12,042 INFO L432 NwaCegarLoop]: 2331 mSDtfsCounter, 2194 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:12,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2194 Valid, 2434 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2024-11-10 01:01:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3442. [2024-11-10 01:01:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3440 states have (on average 2.150581395348837) internal successors, (7398), 3441 states have internal predecessors, (7398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 7398 transitions. [2024-11-10 01:01:12,135 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 7398 transitions. Word has length 83 [2024-11-10 01:01:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:12,136 INFO L471 AbstractCegarLoop]: Abstraction has 3442 states and 7398 transitions. [2024-11-10 01:01:12,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 7398 transitions. [2024-11-10 01:01:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:12,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:12,137 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 01:01:12,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:01:12,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:12,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash 853542607, now seen corresponding path program 1 times [2024-11-10 01:01:12,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:12,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585541045] [2024-11-10 01:01:12,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:12,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:12,215 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 01:01:12,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:12,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585541045] [2024-11-10 01:01:12,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585541045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:12,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:12,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:12,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659685890] [2024-11-10 01:01:12,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:12,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:12,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:12,218 INFO L87 Difference]: Start difference. First operand 3442 states and 7398 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:12,283 INFO L93 Difference]: Finished difference Result 5592 states and 10690 transitions. [2024-11-10 01:01:12,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:12,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:12,302 INFO L225 Difference]: With dead ends: 5592 [2024-11-10 01:01:12,302 INFO L226 Difference]: Without dead ends: 4469 [2024-11-10 01:01:12,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:12,306 INFO L432 NwaCegarLoop]: 2329 mSDtfsCounter, 2192 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:12,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 2436 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2024-11-10 01:01:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4466. [2024-11-10 01:01:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 4464 states have (on average 2.0013440860215055) internal successors, (8934), 4465 states have internal predecessors, (8934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 8934 transitions. [2024-11-10 01:01:12,409 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 8934 transitions. Word has length 83 [2024-11-10 01:01:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:12,410 INFO L471 AbstractCegarLoop]: Abstraction has 4466 states and 8934 transitions. [2024-11-10 01:01:12,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 8934 transitions. [2024-11-10 01:01:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:12,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:12,411 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 01:01:12,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:01:12,412 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:12,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash 839092751, now seen corresponding path program 1 times [2024-11-10 01:01:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:12,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918300314] [2024-11-10 01:01:12,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:12,481 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 01:01:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:12,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918300314] [2024-11-10 01:01:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918300314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:12,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688218381] [2024-11-10 01:01:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:12,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:12,483 INFO L87 Difference]: Start difference. First operand 4466 states and 8934 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:12,585 INFO L93 Difference]: Finished difference Result 8568 states and 15130 transitions. [2024-11-10 01:01:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:12,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:12,603 INFO L225 Difference]: With dead ends: 8568 [2024-11-10 01:01:12,603 INFO L226 Difference]: Without dead ends: 6421 [2024-11-10 01:01:12,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:12,611 INFO L432 NwaCegarLoop]: 2327 mSDtfsCounter, 2190 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:12,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2438 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6421 states. [2024-11-10 01:01:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6421 to 6418. [2024-11-10 01:01:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6418 states, 6416 states have (on average 1.8413341645885286) internal successors, (11814), 6417 states have internal predecessors, (11814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6418 states to 6418 states and 11814 transitions. [2024-11-10 01:01:12,780 INFO L78 Accepts]: Start accepts. Automaton has 6418 states and 11814 transitions. Word has length 83 [2024-11-10 01:01:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:12,780 INFO L471 AbstractCegarLoop]: Abstraction has 6418 states and 11814 transitions. [2024-11-10 01:01:12,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 6418 states and 11814 transitions. [2024-11-10 01:01:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:12,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:12,782 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 01:01:12,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:01:12,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:12,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:12,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1364271793, now seen corresponding path program 1 times [2024-11-10 01:01:12,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:12,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201188979] [2024-11-10 01:01:12,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:12,855 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 01:01:12,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:12,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201188979] [2024-11-10 01:01:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201188979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:12,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635924840] [2024-11-10 01:01:12,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:12,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:12,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:12,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:12,857 INFO L87 Difference]: Start difference. First operand 6418 states and 11814 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:13,107 INFO L93 Difference]: Finished difference Result 14232 states and 23434 transitions. [2024-11-10 01:01:13,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:13,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:13,129 INFO L225 Difference]: With dead ends: 14232 [2024-11-10 01:01:13,129 INFO L226 Difference]: Without dead ends: 10133 [2024-11-10 01:01:13,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:13,137 INFO L432 NwaCegarLoop]: 2325 mSDtfsCounter, 2188 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:13,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2188 Valid, 2440 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10133 states. [2024-11-10 01:01:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10133 to 10130. [2024-11-10 01:01:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10130 states, 10128 states have (on average 1.6972748815165877) internal successors, (17190), 10129 states have internal predecessors, (17190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10130 states to 10130 states and 17190 transitions. [2024-11-10 01:01:13,374 INFO L78 Accepts]: Start accepts. Automaton has 10130 states and 17190 transitions. Word has length 83 [2024-11-10 01:01:13,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:13,374 INFO L471 AbstractCegarLoop]: Abstraction has 10130 states and 17190 transitions. [2024-11-10 01:01:13,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 10130 states and 17190 transitions. [2024-11-10 01:01:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:13,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:13,376 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 01:01:13,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:01:13,376 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:13,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:13,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1888548848, now seen corresponding path program 1 times [2024-11-10 01:01:13,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:13,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951456345] [2024-11-10 01:01:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:13,655 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 01:01:13,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:13,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951456345] [2024-11-10 01:01:13,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951456345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:13,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:13,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:01:13,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495967877] [2024-11-10 01:01:13,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:13,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:01:13,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:13,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:01:13,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:01:13,657 INFO L87 Difference]: Start difference. First operand 10130 states and 17190 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 01:01:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:13,844 INFO L93 Difference]: Finished difference Result 10517 states and 17704 transitions. [2024-11-10 01:01:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:01:13,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 01:01:13,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:13,867 INFO L225 Difference]: With dead ends: 10517 [2024-11-10 01:01:13,868 INFO L226 Difference]: Without dead ends: 10514 [2024-11-10 01:01:13,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:01:13,874 INFO L432 NwaCegarLoop]: 2261 mSDtfsCounter, 0 mSDsluCounter, 13553 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15814 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:13,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15814 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10514 states. [2024-11-10 01:01:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10514 to 10514. [2024-11-10 01:01:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10514 states, 10512 states have (on average 1.6687595129375952) internal successors, (17542), 10513 states have internal predecessors, (17542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10514 states to 10514 states and 17542 transitions. [2024-11-10 01:01:14,134 INFO L78 Accepts]: Start accepts. Automaton has 10514 states and 17542 transitions. Word has length 83 [2024-11-10 01:01:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:14,135 INFO L471 AbstractCegarLoop]: Abstraction has 10514 states and 17542 transitions. [2024-11-10 01:01:14,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 01:01:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 10514 states and 17542 transitions. [2024-11-10 01:01:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:14,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:14,136 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 01:01:14,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:01:14,137 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:14,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:14,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2137026639, now seen corresponding path program 1 times [2024-11-10 01:01:14,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:14,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129052220] [2024-11-10 01:01:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:14,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:14,203 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 01:01:14,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:14,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129052220] [2024-11-10 01:01:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129052220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:14,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:14,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49194940] [2024-11-10 01:01:14,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:14,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:14,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:14,205 INFO L87 Difference]: Start difference. First operand 10514 states and 17542 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:14,542 INFO L93 Difference]: Finished difference Result 26136 states and 39946 transitions. [2024-11-10 01:01:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:14,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:14,579 INFO L225 Difference]: With dead ends: 26136 [2024-11-10 01:01:14,580 INFO L226 Difference]: Without dead ends: 17941 [2024-11-10 01:01:14,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:14,595 INFO L432 NwaCegarLoop]: 2341 mSDtfsCounter, 2196 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2196 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:14,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2196 Valid, 2440 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17941 states. [2024-11-10 01:01:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17941 to 17938. [2024-11-10 01:01:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17938 states, 17936 states have (on average 1.5543041926851027) internal successors, (27878), 17937 states have internal predecessors, (27878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17938 states to 17938 states and 27878 transitions. [2024-11-10 01:01:15,013 INFO L78 Accepts]: Start accepts. Automaton has 17938 states and 27878 transitions. Word has length 83 [2024-11-10 01:01:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:15,014 INFO L471 AbstractCegarLoop]: Abstraction has 17938 states and 27878 transitions. [2024-11-10 01:01:15,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 01:01:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 17938 states and 27878 transitions. [2024-11-10 01:01:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:15,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:15,020 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:15,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:01:15,021 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:15,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1954013601, now seen corresponding path program 1 times [2024-11-10 01:01:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:15,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209596004] [2024-11-10 01:01:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 01:01:15,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:15,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209596004] [2024-11-10 01:01:15,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209596004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:15,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:15,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:15,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937550391] [2024-11-10 01:01:15,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:15,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:15,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:15,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:15,275 INFO L87 Difference]: Start difference. First operand 17938 states and 27878 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:17,177 INFO L93 Difference]: Finished difference Result 125930 states and 181302 transitions. [2024-11-10 01:01:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:17,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 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 108 [2024-11-10 01:01:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:17,473 INFO L225 Difference]: With dead ends: 125930 [2024-11-10 01:01:17,473 INFO L226 Difference]: Without dead ends: 114919 [2024-11-10 01:01:17,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:17,519 INFO L432 NwaCegarLoop]: 2358 mSDtfsCounter, 13985 mSDsluCounter, 3641 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13985 SdHoareTripleChecker+Valid, 5999 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:17,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13985 Valid, 5999 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:01:17,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114919 states. [2024-11-10 01:01:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114919 to 31314. [2024-11-10 01:01:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31314 states, 31312 states have (on average 1.4912493612672457) internal successors, (46694), 31313 states have internal predecessors, (46694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31314 states to 31314 states and 46694 transitions. [2024-11-10 01:01:19,057 INFO L78 Accepts]: Start accepts. Automaton has 31314 states and 46694 transitions. Word has length 108 [2024-11-10 01:01:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:19,057 INFO L471 AbstractCegarLoop]: Abstraction has 31314 states and 46694 transitions. [2024-11-10 01:01:19,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 31314 states and 46694 transitions. [2024-11-10 01:01:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:19,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:19,069 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:19,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:01:19,070 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:19,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1232853791, now seen corresponding path program 1 times [2024-11-10 01:01:19,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:19,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246135348] [2024-11-10 01:01:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 01:01:19,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246135348] [2024-11-10 01:01:19,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246135348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:19,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:19,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:19,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492191795] [2024-11-10 01:01:19,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:19,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:19,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:19,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:19,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:19,297 INFO L87 Difference]: Start difference. First operand 31314 states and 46694 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:21,699 INFO L93 Difference]: Finished difference Result 141546 states and 203382 transitions. [2024-11-10 01:01:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:21,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 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 108 [2024-11-10 01:01:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:21,959 INFO L225 Difference]: With dead ends: 141546 [2024-11-10 01:01:21,959 INFO L226 Difference]: Without dead ends: 125927 [2024-11-10 01:01:22,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:22,042 INFO L432 NwaCegarLoop]: 2359 mSDtfsCounter, 13989 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13989 SdHoareTripleChecker+Valid, 5911 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:22,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13989 Valid, 5911 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125927 states. [2024-11-10 01:01:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125927 to 52434. [2024-11-10 01:01:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52434 states, 52432 states have (on average 1.4569346963686298) internal successors, (76390), 52433 states have internal predecessors, (76390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52434 states to 52434 states and 76390 transitions. [2024-11-10 01:01:24,312 INFO L78 Accepts]: Start accepts. Automaton has 52434 states and 76390 transitions. Word has length 108 [2024-11-10 01:01:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:24,313 INFO L471 AbstractCegarLoop]: Abstraction has 52434 states and 76390 transitions. [2024-11-10 01:01:24,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 52434 states and 76390 transitions. [2024-11-10 01:01:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:24,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:24,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:24,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:01:24,323 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:24,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2005394591, now seen corresponding path program 1 times [2024-11-10 01:01:24,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:24,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123525587] [2024-11-10 01:01:24,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 01:01:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:24,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123525587] [2024-11-10 01:01:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123525587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:24,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978922597] [2024-11-10 01:01:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:24,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:24,546 INFO L87 Difference]: Start difference. First operand 52434 states and 76390 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:27,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:27,535 INFO L93 Difference]: Finished difference Result 157162 states and 225398 transitions. [2024-11-10 01:01:27,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:27,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 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 108 [2024-11-10 01:01:27,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:27,755 INFO L225 Difference]: With dead ends: 157162 [2024-11-10 01:01:27,755 INFO L226 Difference]: Without dead ends: 141543 [2024-11-10 01:01:27,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:27,818 INFO L432 NwaCegarLoop]: 2356 mSDtfsCounter, 14035 mSDsluCounter, 3570 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14035 SdHoareTripleChecker+Valid, 5926 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:27,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14035 Valid, 5926 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141543 states. [2024-11-10 01:01:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141543 to 68050. [2024-11-10 01:01:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68050 states, 68048 states have (on average 1.4461262638137784) internal successors, (98406), 68049 states have internal predecessors, (98406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68050 states to 68050 states and 98406 transitions. [2024-11-10 01:01:30,424 INFO L78 Accepts]: Start accepts. Automaton has 68050 states and 98406 transitions. Word has length 108 [2024-11-10 01:01:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:30,424 INFO L471 AbstractCegarLoop]: Abstraction has 68050 states and 98406 transitions. [2024-11-10 01:01:30,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 68050 states and 98406 transitions. [2024-11-10 01:01:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:30,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:30,436 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:30,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:01:30,436 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:30,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1288162977, now seen corresponding path program 1 times [2024-11-10 01:01:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925898743] [2024-11-10 01:01:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 01:01:30,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:30,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925898743] [2024-11-10 01:01:30,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925898743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:30,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:30,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:30,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054106057] [2024-11-10 01:01:30,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:30,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:30,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:30,725 INFO L87 Difference]: Start difference. First operand 68050 states and 98406 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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 01:01:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:34,417 INFO L93 Difference]: Finished difference Result 172778 states and 247414 transitions. [2024-11-10 01:01:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:34,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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 108 [2024-11-10 01:01:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:34,654 INFO L225 Difference]: With dead ends: 172778 [2024-11-10 01:01:34,654 INFO L226 Difference]: Without dead ends: 157159 [2024-11-10 01:01:34,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:34,698 INFO L432 NwaCegarLoop]: 2353 mSDtfsCounter, 14092 mSDsluCounter, 3490 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14092 SdHoareTripleChecker+Valid, 5843 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:34,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14092 Valid, 5843 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157159 states. [2024-11-10 01:01:37,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157159 to 83666. [2024-11-10 01:01:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83666 states, 83664 states have (on average 1.4393526486899981) internal successors, (120422), 83665 states have internal predecessors, (120422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83666 states to 83666 states and 120422 transitions. [2024-11-10 01:01:37,721 INFO L78 Accepts]: Start accepts. Automaton has 83666 states and 120422 transitions. Word has length 108 [2024-11-10 01:01:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:37,722 INFO L471 AbstractCegarLoop]: Abstraction has 83666 states and 120422 transitions. [2024-11-10 01:01:37,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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 01:01:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 83666 states and 120422 transitions. [2024-11-10 01:01:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:37,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:37,734 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:37,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:01:37,734 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:37,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1273713121, now seen corresponding path program 1 times [2024-11-10 01:01:37,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:37,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366220011] [2024-11-10 01:01:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:37,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:38,208 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 01:01:38,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:38,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366220011] [2024-11-10 01:01:38,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366220011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:38,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:38,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:38,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204961074] [2024-11-10 01:01:38,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:38,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:38,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:38,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:38,210 INFO L87 Difference]: Start difference. First operand 83666 states and 120422 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 01:01:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:42,042 INFO L93 Difference]: Finished difference Result 188394 states and 269430 transitions. [2024-11-10 01:01:42,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:42,043 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 108 [2024-11-10 01:01:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:42,429 INFO L225 Difference]: With dead ends: 188394 [2024-11-10 01:01:42,430 INFO L226 Difference]: Without dead ends: 172775 [2024-11-10 01:01:42,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:42,480 INFO L432 NwaCegarLoop]: 2350 mSDtfsCounter, 14148 mSDsluCounter, 3528 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14148 SdHoareTripleChecker+Valid, 5878 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:42,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14148 Valid, 5878 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172775 states. [2024-11-10 01:01:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172775 to 99282. [2024-11-10 01:01:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99282 states, 99280 states have (on average 1.434709911361805) internal successors, (142438), 99281 states have internal predecessors, (142438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99282 states to 99282 states and 142438 transitions. [2024-11-10 01:01:46,073 INFO L78 Accepts]: Start accepts. Automaton has 99282 states and 142438 transitions. Word has length 108 [2024-11-10 01:01:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:46,074 INFO L471 AbstractCegarLoop]: Abstraction has 99282 states and 142438 transitions. [2024-11-10 01:01:46,074 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 01:01:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 99282 states and 142438 transitions. [2024-11-10 01:01:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:46,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:46,085 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:01:46,085 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:46,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash -929651423, now seen corresponding path program 1 times [2024-11-10 01:01:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917985729] [2024-11-10 01:01:46,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 01:01:46,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:46,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917985729] [2024-11-10 01:01:46,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917985729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:46,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:46,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:46,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836468320] [2024-11-10 01:01:46,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:46,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:46,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:46,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:46,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:46,387 INFO L87 Difference]: Start difference. First operand 99282 states and 142438 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 01:01:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:50,830 INFO L93 Difference]: Finished difference Result 204010 states and 291446 transitions. [2024-11-10 01:01:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:50,831 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 108 [2024-11-10 01:01:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:51,099 INFO L225 Difference]: With dead ends: 204010 [2024-11-10 01:01:51,099 INFO L226 Difference]: Without dead ends: 188391 [2024-11-10 01:01:51,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:51,150 INFO L432 NwaCegarLoop]: 2350 mSDtfsCounter, 14008 mSDsluCounter, 3615 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14008 SdHoareTripleChecker+Valid, 5965 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:51,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14008 Valid, 5965 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:01:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188391 states.