./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label02.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.1.ufo.BOUNDED-14.pals+Problem12_label02.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 6e57a5fe539c02a3f122e940e947b466cbee4432e151d616552c45a0bb305ecc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:59:38,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:59:38,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:59:38,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:59:38,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:59:39,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:59:39,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:59:39,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:59:39,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:59:39,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:59:39,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:59:39,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:59:39,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:59:39,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:59:39,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:59:39,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:59:39,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:59:39,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:59:39,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:59:39,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:59:39,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:59:39,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:59:39,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:59:39,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:59:39,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:59:39,030 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:59:39,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:59:39,030 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:59:39,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:59:39,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:59:39,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:59:39,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:59:39,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:59:39,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:59:39,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:59:39,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:59:39,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:59:39,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:59:39,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:59:39,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:59:39,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:59:39,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:59:39,034 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 -> 6e57a5fe539c02a3f122e940e947b466cbee4432e151d616552c45a0bb305ecc [2024-11-10 00:59:39,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:59:39,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:59:39,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:59:39,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:59:39,301 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:59:39,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c [2024-11-10 00:59:40,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:59:41,053 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:59:41,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c [2024-11-10 00:59:41,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e01583d0/2d3969a5571141bdbb0632d9da7e00da/FLAG565eea525 [2024-11-10 00:59:41,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e01583d0/2d3969a5571141bdbb0632d9da7e00da [2024-11-10 00:59:41,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:59:41,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:59:41,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:59:41,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:59:41,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:59:41,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:41" (1/1) ... [2024-11-10 00:59:41,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342f53c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:41, skipping insertion in model container [2024-11-10 00:59:41,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:41" (1/1) ... [2024-11-10 00:59:41,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:59:41,455 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.1.ufo.BOUNDED-14.pals+Problem12_label02.c[20463,20476] [2024-11-10 00:59:41,490 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.1.ufo.BOUNDED-14.pals+Problem12_label02.c[27753,27766] [2024-11-10 00:59:41,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:59:41,985 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:59:42,024 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.1.ufo.BOUNDED-14.pals+Problem12_label02.c[20463,20476] [2024-11-10 00:59:42,033 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.1.ufo.BOUNDED-14.pals+Problem12_label02.c[27753,27766] [2024-11-10 00:59:42,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:59:42,327 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:59:42,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42 WrapperNode [2024-11-10 00:59:42,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:59:42,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:59:42,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:59:42,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:59:42,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:42,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:42,594 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5220 [2024-11-10 00:59:42,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:59:42,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:59:42,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:59:42,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:59:42,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:42,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:42,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:42,957 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 00:59:42,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:42,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:43,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:43,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:43,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:43,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:43,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:59:43,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:59:43,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:59:43,199 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:59:43,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2024-11-10 00:59:43,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:59:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:59:43,227 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 00:59:43,229 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 00:59:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:59:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:59:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:59:43,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:59:43,349 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:59:43,351 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:59:47,887 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5256: havoc calculate_output3_#t~ret48#1; [2024-11-10 00:59:47,887 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc calculate_output_#t~ret46#1; [2024-11-10 00:59:47,887 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3766: havoc calculate_output2_#t~ret47#1; [2024-11-10 00:59:48,059 INFO L? ?]: Removed 2091 outVars from TransFormulas that were not future-live. [2024-11-10 00:59:48,059 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:59:48,087 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:59:48,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:59:48,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:59:48 BoogieIcfgContainer [2024-11-10 00:59:48,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:59:48,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:59:48,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:59:48,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:59:48,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:59:41" (1/3) ... [2024-11-10 00:59:48,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324702cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:59:48, skipping insertion in model container [2024-11-10 00:59:48,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (2/3) ... [2024-11-10 00:59:48,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324702cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:59:48, skipping insertion in model container [2024-11-10 00:59:48,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:59:48" (3/3) ... [2024-11-10 00:59:48,094 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c [2024-11-10 00:59:48,106 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:59:48,106 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:59:48,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:59:48,175 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;@70da8238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:59:48,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:59:48,183 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 00:59:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 00:59:48,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:48,191 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 00:59:48,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:48,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash -685889018, now seen corresponding path program 1 times [2024-11-10 00:59:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:48,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183136681] [2024-11-10 00:59:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:48,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:48,399 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 00:59:48,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183136681] [2024-11-10 00:59:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183136681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:48,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:48,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:59:48,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957292793] [2024-11-10 00:59:48,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:48,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:59:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:48,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:59:48,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:59:48,425 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 00:59:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:48,488 INFO L93 Difference]: Finished difference Result 1816 states and 4794 transitions. [2024-11-10 00:59:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:59:48,490 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 00:59:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:48,504 INFO L225 Difference]: With dead ends: 1816 [2024-11-10 00:59:48,504 INFO L226 Difference]: Without dead ends: 869 [2024-11-10 00:59:48,509 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 00:59:48,511 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 00:59:48,512 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 00:59:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-10 00:59:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2024-11-10 00:59:48,575 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 00:59:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2317 transitions. [2024-11-10 00:59:48,579 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2317 transitions. Word has length 30 [2024-11-10 00:59:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:48,580 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 2317 transitions. [2024-11-10 00:59:48,580 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 00:59:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2317 transitions. [2024-11-10 00:59:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 00:59:48,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:48,581 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 00:59:48,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:59:48,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:48,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash -752895771, now seen corresponding path program 1 times [2024-11-10 00:59:48,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:48,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464012263] [2024-11-10 00:59:48,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:48,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:48,781 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 00:59:48,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:48,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464012263] [2024-11-10 00:59:48,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464012263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:48,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:48,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:59:48,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522982717] [2024-11-10 00:59:48,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:48,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:59:48,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:48,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:59:48,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:59:48,786 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 00:59:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:49,007 INFO L93 Difference]: Finished difference Result 930 states and 2411 transitions. [2024-11-10 00:59:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:59:49,008 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 00:59:49,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:49,013 INFO L225 Difference]: With dead ends: 930 [2024-11-10 00:59:49,013 INFO L226 Difference]: Without dead ends: 869 [2024-11-10 00:59:49,014 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 00:59:49,015 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.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:49,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9205 Invalid, 62 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-10 00:59:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2024-11-10 00:59:49,051 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 00:59:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2267 transitions. [2024-11-10 00:59:49,058 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2267 transitions. Word has length 30 [2024-11-10 00:59:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:49,058 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 2267 transitions. [2024-11-10 00:59:49,058 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 00:59:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2267 transitions. [2024-11-10 00:59:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:59:49,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:49,061 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] [2024-11-10 00:59:49,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:59:49,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:49,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash -735299423, now seen corresponding path program 1 times [2024-11-10 00:59:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:49,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192705854] [2024-11-10 00:59:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:49,314 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 00:59:49,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:49,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192705854] [2024-11-10 00:59:49,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192705854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:49,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:49,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:49,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573703372] [2024-11-10 00:59:49,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:49,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:59:49,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:49,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:59:49,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:59:49,319 INFO L87 Difference]: Start difference. First operand 869 states and 2267 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:56,708 INFO L93 Difference]: Finished difference Result 3128 states and 8620 transitions. [2024-11-10 00:59:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:59:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-10 00:59:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:56,725 INFO L225 Difference]: With dead ends: 3128 [2024-11-10 00:59:56,726 INFO L226 Difference]: Without dead ends: 2373 [2024-11-10 00:59:56,727 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 00:59:56,728 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 4521 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8074 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4521 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 9227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 8074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:56,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4521 Valid, 846 Invalid, 9227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 8074 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-10 00:59:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2024-11-10 00:59:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2373. [2024-11-10 00:59:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 2371 states have (on average 2.4221847321805146) internal successors, (5743), 2372 states have internal predecessors, (5743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 5743 transitions. [2024-11-10 00:59:56,796 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 5743 transitions. Word has length 65 [2024-11-10 00:59:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:56,797 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 5743 transitions. [2024-11-10 00:59:56,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 5743 transitions. [2024-11-10 00:59:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:59:56,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:56,803 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 00:59:56,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:59:56,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:56,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1903427819, now seen corresponding path program 1 times [2024-11-10 00:59:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:56,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558201551] [2024-11-10 00:59:56,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:57,074 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 00:59:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558201551] [2024-11-10 00:59:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558201551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:57,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:57,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:59:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808010316] [2024-11-10 00:59:57,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:57,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:59:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:57,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:59:57,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:59:57,076 INFO L87 Difference]: Start difference. First operand 2373 states and 5743 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 00:59:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:57,619 INFO L93 Difference]: Finished difference Result 3171 states and 7003 transitions. [2024-11-10 00:59:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 00:59:57,620 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 00:59:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:57,630 INFO L225 Difference]: With dead ends: 3171 [2024-11-10 00:59:57,631 INFO L226 Difference]: Without dead ends: 3114 [2024-11-10 00:59:57,632 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 00:59:57,633 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.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:57,633 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.3s Time] [2024-11-10 00:59:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2024-11-10 00:59:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2427. [2024-11-10 00:59:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2425 states have (on average 2.4037113402061854) internal successors, (5829), 2426 states have internal predecessors, (5829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 5829 transitions. [2024-11-10 00:59:57,734 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 5829 transitions. Word has length 79 [2024-11-10 00:59:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:57,735 INFO L471 AbstractCegarLoop]: Abstraction has 2427 states and 5829 transitions. [2024-11-10 00:59:57,735 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 00:59:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 5829 transitions. [2024-11-10 00:59:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:59:57,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:57,737 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 00:59:57,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:59:57,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:57,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1827426509, now seen corresponding path program 1 times [2024-11-10 00:59:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:57,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409467478] [2024-11-10 00:59:57,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:57,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:58,093 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 00:59:58,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:58,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409467478] [2024-11-10 00:59:58,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409467478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:58,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:58,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:59:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016637619] [2024-11-10 00:59:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:58,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:59:58,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:58,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:59:58,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:59:58,096 INFO L87 Difference]: Start difference. First operand 2427 states and 5829 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 00:59:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:58,397 INFO L93 Difference]: Finished difference Result 2541 states and 6007 transitions. [2024-11-10 00:59:58,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:59:58,398 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 00:59:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:58,405 INFO L225 Difference]: With dead ends: 2541 [2024-11-10 00:59:58,406 INFO L226 Difference]: Without dead ends: 2430 [2024-11-10 00:59:58,406 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 00:59:58,407 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 00:59:58,407 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 00:59:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2024-11-10 00:59:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2427. [2024-11-10 00:59:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2425 states have (on average 2.403298969072165) internal successors, (5828), 2426 states have internal predecessors, (5828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 5828 transitions. [2024-11-10 00:59:58,445 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 5828 transitions. Word has length 81 [2024-11-10 00:59:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:58,445 INFO L471 AbstractCegarLoop]: Abstraction has 2427 states and 5828 transitions. [2024-11-10 00:59:58,445 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 00:59:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 5828 transitions. [2024-11-10 00:59:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:59:58,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:58,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:58,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:59:58,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:58,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:58,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1755501160, now seen corresponding path program 1 times [2024-11-10 00:59:58,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:58,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034104744] [2024-11-10 00:59:58,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:58,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:58,507 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 00:59:58,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:58,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034104744] [2024-11-10 00:59:58,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034104744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:58,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:58,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:58,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968967406] [2024-11-10 00:59:58,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:58,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:58,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:58,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:58,509 INFO L87 Difference]: Start difference. First operand 2427 states and 5828 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 00:59:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:58,539 INFO L93 Difference]: Finished difference Result 2637 states and 6158 transitions. [2024-11-10 00:59:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:58,539 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 00:59:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:58,547 INFO L225 Difference]: With dead ends: 2637 [2024-11-10 00:59:58,547 INFO L226 Difference]: Without dead ends: 2526 [2024-11-10 00:59:58,547 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 00:59:58,548 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 00:59:58,549 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 00:59:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2024-11-10 00:59:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2523. [2024-11-10 00:59:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2521 states have (on average 2.3712812376041255) internal successors, (5978), 2522 states have internal predecessors, (5978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 5978 transitions. [2024-11-10 00:59:58,595 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 5978 transitions. Word has length 82 [2024-11-10 00:59:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:58,596 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 5978 transitions. [2024-11-10 00:59:58,596 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 00:59:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 5978 transitions. [2024-11-10 00:59:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:59:58,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:58,597 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 00:59:58,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:59:58,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:58,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:58,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1519393231, now seen corresponding path program 1 times [2024-11-10 00:59:58,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:58,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625363014] [2024-11-10 00:59:58,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:58,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:58,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 00:59:58,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:58,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625363014] [2024-11-10 00:59:58,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625363014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:58,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:58,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:58,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448575193] [2024-11-10 00:59:58,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:58,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:58,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:58,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:58,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:58,657 INFO L87 Difference]: Start difference. First operand 2523 states and 5978 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 00:59:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:58,686 INFO L93 Difference]: Finished difference Result 2740 states and 6318 transitions. [2024-11-10 00:59:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:58,686 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 00:59:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:58,694 INFO L225 Difference]: With dead ends: 2740 [2024-11-10 00:59:58,694 INFO L226 Difference]: Without dead ends: 2629 [2024-11-10 00:59:58,695 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 00:59:58,695 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 00:59:58,696 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 00:59:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2024-11-10 00:59:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2626. [2024-11-10 00:59:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2624 states have (on average 2.339176829268293) internal successors, (6138), 2625 states have internal predecessors, (6138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 6138 transitions. [2024-11-10 00:59:58,738 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 6138 transitions. Word has length 83 [2024-11-10 00:59:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:58,738 INFO L471 AbstractCegarLoop]: Abstraction has 2626 states and 6138 transitions. [2024-11-10 00:59:58,739 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 00:59:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 6138 transitions. [2024-11-10 00:59:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:59:58,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:58,739 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 00:59:58,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:59:58,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1667474161, now seen corresponding path program 1 times [2024-11-10 00:59:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981676869] [2024-11-10 00:59:58,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:58,790 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 00:59:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981676869] [2024-11-10 00:59:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981676869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:58,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:58,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:58,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156983310] [2024-11-10 00:59:58,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:58,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:58,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:58,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:58,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:58,794 INFO L87 Difference]: Start difference. First operand 2626 states and 6138 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 00:59:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:58,829 INFO L93 Difference]: Finished difference Result 3216 states and 7060 transitions. [2024-11-10 00:59:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:58,830 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 00:59:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:58,838 INFO L225 Difference]: With dead ends: 3216 [2024-11-10 00:59:58,838 INFO L226 Difference]: Without dead ends: 2909 [2024-11-10 00:59:58,840 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 00:59:58,841 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 00:59:58,841 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 00:59:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2024-11-10 00:59:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2906. [2024-11-10 00:59:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2904 states have (on average 2.262396694214876) internal successors, (6570), 2905 states have internal predecessors, (6570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 6570 transitions. [2024-11-10 00:59:58,901 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 6570 transitions. Word has length 83 [2024-11-10 00:59:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:58,901 INFO L471 AbstractCegarLoop]: Abstraction has 2906 states and 6570 transitions. [2024-11-10 00:59:58,901 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 00:59:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 6570 transitions. [2024-11-10 00:59:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:59:58,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:58,902 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 00:59:58,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:59:58,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:58,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1854952335, now seen corresponding path program 1 times [2024-11-10 00:59:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:58,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839058080] [2024-11-10 00:59:58,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:58,954 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 00:59:58,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:58,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839058080] [2024-11-10 00:59:58,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839058080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:58,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:58,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:58,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082823094] [2024-11-10 00:59:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:58,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:58,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:58,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:58,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:58,958 INFO L87 Difference]: Start difference. First operand 2906 states and 6570 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 00:59:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:58,993 INFO L93 Difference]: Finished difference Result 4032 states and 8314 transitions. [2024-11-10 00:59:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:58,997 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 00:59:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:59,014 INFO L225 Difference]: With dead ends: 4032 [2024-11-10 00:59:59,014 INFO L226 Difference]: Without dead ends: 3445 [2024-11-10 00:59:59,016 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 00:59:59,019 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 00:59:59,019 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 00:59:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2024-11-10 00:59:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3442. [2024-11-10 00:59:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3440 states have (on average 2.147093023255814) internal successors, (7386), 3441 states have internal predecessors, (7386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 7386 transitions. [2024-11-10 00:59:59,071 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 7386 transitions. Word has length 83 [2024-11-10 00:59:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:59,071 INFO L471 AbstractCegarLoop]: Abstraction has 3442 states and 7386 transitions. [2024-11-10 00:59:59,072 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 00:59:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 7386 transitions. [2024-11-10 00:59:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:59:59,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:59,072 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 00:59:59,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:59:59,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:59,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash 853542607, now seen corresponding path program 1 times [2024-11-10 00:59:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:59,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369900638] [2024-11-10 00:59:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:59,127 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 00:59:59,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:59,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369900638] [2024-11-10 00:59:59,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369900638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:59,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609126134] [2024-11-10 00:59:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:59,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:59,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:59,131 INFO L87 Difference]: Start difference. First operand 3442 states and 7386 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 00:59:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:59,178 INFO L93 Difference]: Finished difference Result 5592 states and 10678 transitions. [2024-11-10 00:59:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:59,178 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 00:59:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:59,190 INFO L225 Difference]: With dead ends: 5592 [2024-11-10 00:59:59,190 INFO L226 Difference]: Without dead ends: 4469 [2024-11-10 00:59:59,192 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 00:59:59,193 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 00:59:59,193 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 00:59:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2024-11-10 00:59:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4466. [2024-11-10 00:59:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 4464 states have (on average 1.9986559139784945) internal successors, (8922), 4465 states have internal predecessors, (8922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 8922 transitions. [2024-11-10 00:59:59,264 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 8922 transitions. Word has length 83 [2024-11-10 00:59:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:59,265 INFO L471 AbstractCegarLoop]: Abstraction has 4466 states and 8922 transitions. [2024-11-10 00:59:59,265 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 00:59:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 8922 transitions. [2024-11-10 00:59:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:59:59,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:59,266 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 00:59:59,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:59:59,266 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:59,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:59,267 INFO L85 PathProgramCache]: Analyzing trace with hash 839092751, now seen corresponding path program 1 times [2024-11-10 00:59:59,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:59,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290079676] [2024-11-10 00:59:59,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:59,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:59,409 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 00:59:59,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:59,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290079676] [2024-11-10 00:59:59,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290079676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:59,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:59,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:59,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399946711] [2024-11-10 00:59:59,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:59,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:59,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:59,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:59,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:59,412 INFO L87 Difference]: Start difference. First operand 4466 states and 8922 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 00:59:59,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:59,499 INFO L93 Difference]: Finished difference Result 8568 states and 15118 transitions. [2024-11-10 00:59:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:59,499 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 00:59:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:59,511 INFO L225 Difference]: With dead ends: 8568 [2024-11-10 00:59:59,512 INFO L226 Difference]: Without dead ends: 6421 [2024-11-10 00:59:59,516 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 00:59:59,517 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 00:59:59,518 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 00:59:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6421 states. [2024-11-10 00:59:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6421 to 6418. [2024-11-10 00:59:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6418 states, 6416 states have (on average 1.8394638403990025) internal successors, (11802), 6417 states have internal predecessors, (11802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6418 states to 6418 states and 11802 transitions. [2024-11-10 00:59:59,644 INFO L78 Accepts]: Start accepts. Automaton has 6418 states and 11802 transitions. Word has length 83 [2024-11-10 00:59:59,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:59,644 INFO L471 AbstractCegarLoop]: Abstraction has 6418 states and 11802 transitions. [2024-11-10 00:59:59,644 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 00:59:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6418 states and 11802 transitions. [2024-11-10 00:59:59,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:59:59,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:59,645 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 00:59:59,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:59:59,646 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:59,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1364271793, now seen corresponding path program 1 times [2024-11-10 00:59:59,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:59,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701811095] [2024-11-10 00:59:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:59,697 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 00:59:59,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:59,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701811095] [2024-11-10 00:59:59,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701811095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:59,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:59,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460348646] [2024-11-10 00:59:59,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:59,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:59,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:59,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:59,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:59,699 INFO L87 Difference]: Start difference. First operand 6418 states and 11802 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 00:59:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:59,812 INFO L93 Difference]: Finished difference Result 14232 states and 23422 transitions. [2024-11-10 00:59:59,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:59,812 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 00:59:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:59,828 INFO L225 Difference]: With dead ends: 14232 [2024-11-10 00:59:59,828 INFO L226 Difference]: Without dead ends: 10133 [2024-11-10 00:59:59,834 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 00:59:59,835 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 00:59:59,835 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 00:59:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10133 states. [2024-11-10 01:00:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10133 to 10130. [2024-11-10 01:00:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10130 states, 10128 states have (on average 1.6960900473933649) internal successors, (17178), 10129 states have internal predecessors, (17178), 0 states have call successors, (0), 0 states have 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:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10130 states to 10130 states and 17178 transitions. [2024-11-10 01:00:00,038 INFO L78 Accepts]: Start accepts. Automaton has 10130 states and 17178 transitions. Word has length 83 [2024-11-10 01:00:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 10130 states and 17178 transitions. [2024-11-10 01:00:00,039 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:00:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 10130 states and 17178 transitions. [2024-11-10 01:00:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:00:00,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:00,040 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:00:00,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:00:00,041 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:00,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1888548848, now seen corresponding path program 1 times [2024-11-10 01:00:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137579882] [2024-11-10 01:00:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:00,280 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:00:00,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:00,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137579882] [2024-11-10 01:00:00,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137579882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:00,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:00,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:00:00,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468501338] [2024-11-10 01:00:00,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:00,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:00:00,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:00,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:00:00,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:00:00,282 INFO L87 Difference]: Start difference. First operand 10130 states and 17178 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:00:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:00,438 INFO L93 Difference]: Finished difference Result 10517 states and 17692 transitions. [2024-11-10 01:00:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:00:00,439 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:00:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:00,456 INFO L225 Difference]: With dead ends: 10517 [2024-11-10 01:00:00,456 INFO L226 Difference]: Without dead ends: 10514 [2024-11-10 01:00:00,461 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:00:00,462 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:00:00,462 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:00:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10514 states. [2024-11-10 01:00:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10514 to 10514. [2024-11-10 01:00:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10514 states, 10512 states have (on average 1.6676179604261796) internal successors, (17530), 10513 states have internal predecessors, (17530), 0 states have call successors, (0), 0 states have 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:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10514 states to 10514 states and 17530 transitions. [2024-11-10 01:00:00,721 INFO L78 Accepts]: Start accepts. Automaton has 10514 states and 17530 transitions. Word has length 83 [2024-11-10 01:00:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:00,721 INFO L471 AbstractCegarLoop]: Abstraction has 10514 states and 17530 transitions. [2024-11-10 01:00:00,721 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:00:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 10514 states and 17530 transitions. [2024-11-10 01:00:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:00:00,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:00,722 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:00:00,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:00:00,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:00,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2137026639, now seen corresponding path program 1 times [2024-11-10 01:00:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:00,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65435104] [2024-11-10 01:00:00,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:00,782 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:00:00,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:00,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65435104] [2024-11-10 01:00:00,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65435104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:00,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:00,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614123575] [2024-11-10 01:00:00,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:00,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:00,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:00,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:00,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:00,784 INFO L87 Difference]: Start difference. First operand 10514 states and 17530 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:00:01,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:01,068 INFO L93 Difference]: Finished difference Result 26136 states and 39934 transitions. [2024-11-10 01:00:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:01,069 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:00:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:01,096 INFO L225 Difference]: With dead ends: 26136 [2024-11-10 01:00:01,097 INFO L226 Difference]: Without dead ends: 17941 [2024-11-10 01:00:01,108 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:00:01,109 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:00:01,109 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:00:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17941 states. [2024-11-10 01:00:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17941 to 17938. [2024-11-10 01:00:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17938 states, 17936 states have (on average 1.553635147190009) internal successors, (27866), 17937 states have internal predecessors, (27866), 0 states have call successors, (0), 0 states have 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:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17938 states to 17938 states and 27866 transitions. [2024-11-10 01:00:01,606 INFO L78 Accepts]: Start accepts. Automaton has 17938 states and 27866 transitions. Word has length 83 [2024-11-10 01:00:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:01,606 INFO L471 AbstractCegarLoop]: Abstraction has 17938 states and 27866 transitions. [2024-11-10 01:00:01,606 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:00:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17938 states and 27866 transitions. [2024-11-10 01:00:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:00:01,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:01,611 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:00:01,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:00:01,612 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:01,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1954013601, now seen corresponding path program 1 times [2024-11-10 01:00:01,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:01,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886442430] [2024-11-10 01:00:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:01,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:01,871 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:00:01,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:01,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886442430] [2024-11-10 01:00:01,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886442430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:01,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:01,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:00:01,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752735999] [2024-11-10 01:00:01,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:01,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:00:01,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:01,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:00:01,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:00:01,877 INFO L87 Difference]: Start difference. First operand 17938 states and 27866 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:00:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:03,768 INFO L93 Difference]: Finished difference Result 125930 states and 181290 transitions. [2024-11-10 01:00:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:00:03,769 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:00:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:03,958 INFO L225 Difference]: With dead ends: 125930 [2024-11-10 01:00:03,959 INFO L226 Difference]: Without dead ends: 114919 [2024-11-10 01:00:03,998 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:00:03,998 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:00:03,999 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:00:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114919 states. [2024-11-10 01:00:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114919 to 31314. [2024-11-10 01:00:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31314 states, 31312 states have (on average 1.4908661216147163) internal successors, (46682), 31313 states have internal predecessors, (46682), 0 states have call successors, (0), 0 states have 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:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31314 states to 31314 states and 46682 transitions. [2024-11-10 01:00:05,385 INFO L78 Accepts]: Start accepts. Automaton has 31314 states and 46682 transitions. Word has length 108 [2024-11-10 01:00:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:05,385 INFO L471 AbstractCegarLoop]: Abstraction has 31314 states and 46682 transitions. [2024-11-10 01:00:05,386 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:00:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 31314 states and 46682 transitions. [2024-11-10 01:00:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:00:05,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:05,394 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:00:05,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:00:05,394 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:05,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:05,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1232853791, now seen corresponding path program 1 times [2024-11-10 01:00:05,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:05,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076717737] [2024-11-10 01:00:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:05,570 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:00:05,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:05,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076717737] [2024-11-10 01:00:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076717737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:05,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:05,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:00:05,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215985143] [2024-11-10 01:00:05,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:05,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:00:05,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:05,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:00:05,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:00:05,573 INFO L87 Difference]: Start difference. First operand 31314 states and 46682 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:00:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:08,457 INFO L93 Difference]: Finished difference Result 141546 states and 203370 transitions. [2024-11-10 01:00:08,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:00:08,458 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:00:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:08,681 INFO L225 Difference]: With dead ends: 141546 [2024-11-10 01:00:08,682 INFO L226 Difference]: Without dead ends: 125927 [2024-11-10 01:00:08,715 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:00:08,715 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:00:08,718 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:00:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125927 states. [2024-11-10 01:00:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125927 to 52434. [2024-11-10 01:00:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52434 states, 52432 states have (on average 1.4567058285016783) internal successors, (76378), 52433 states have internal predecessors, (76378), 0 states have call successors, (0), 0 states have 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:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52434 states to 52434 states and 76378 transitions. [2024-11-10 01:00:10,610 INFO L78 Accepts]: Start accepts. Automaton has 52434 states and 76378 transitions. Word has length 108 [2024-11-10 01:00:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:10,610 INFO L471 AbstractCegarLoop]: Abstraction has 52434 states and 76378 transitions. [2024-11-10 01:00:10,610 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:00:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 52434 states and 76378 transitions. [2024-11-10 01:00:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:00:10,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:10,623 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:00:10,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:00:10,623 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:10,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2005394591, now seen corresponding path program 1 times [2024-11-10 01:00:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:10,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173279070] [2024-11-10 01:00:10,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:10,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:10,806 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:00:10,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:10,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173279070] [2024-11-10 01:00:10,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173279070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:10,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:10,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:00:10,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294019356] [2024-11-10 01:00:10,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:10,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:00:10,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:10,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:00:10,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:00:10,808 INFO L87 Difference]: Start difference. First operand 52434 states and 76378 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:00:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:13,838 INFO L93 Difference]: Finished difference Result 157162 states and 225386 transitions. [2024-11-10 01:00:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:00:13,839 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:00:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:14,068 INFO L225 Difference]: With dead ends: 157162 [2024-11-10 01:00:14,068 INFO L226 Difference]: Without dead ends: 141543 [2024-11-10 01:00:14,105 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:00:14,105 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:00:14,106 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:00:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141543 states. [2024-11-10 01:00:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141543 to 68050. [2024-11-10 01:00:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68050 states, 68048 states have (on average 1.4459499177051494) internal successors, (98394), 68049 states have internal predecessors, (98394), 0 states have call successors, (0), 0 states have 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:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68050 states to 68050 states and 98394 transitions. [2024-11-10 01:00:16,737 INFO L78 Accepts]: Start accepts. Automaton has 68050 states and 98394 transitions. Word has length 108 [2024-11-10 01:00:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:16,738 INFO L471 AbstractCegarLoop]: Abstraction has 68050 states and 98394 transitions. [2024-11-10 01:00:16,738 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:00:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 68050 states and 98394 transitions. [2024-11-10 01:00:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:00:16,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:16,746 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:00:16,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:00:16,746 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:16,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1288162977, now seen corresponding path program 1 times [2024-11-10 01:00:16,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:16,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409173474] [2024-11-10 01:00:16,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:16,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:16,957 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:00:16,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:16,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409173474] [2024-11-10 01:00:16,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409173474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:16,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:16,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:00:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165158137] [2024-11-10 01:00:16,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:16,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:00:16,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:16,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:00:16,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:00:16,959 INFO L87 Difference]: Start difference. First operand 68050 states and 98394 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:00:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:20,462 INFO L93 Difference]: Finished difference Result 172778 states and 247402 transitions. [2024-11-10 01:00:20,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:00:20,463 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:00:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:20,681 INFO L225 Difference]: With dead ends: 172778 [2024-11-10 01:00:20,681 INFO L226 Difference]: Without dead ends: 157159 [2024-11-10 01:00:20,732 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:00:20,736 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:00:20,736 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:00:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157159 states. [2024-11-10 01:00:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157159 to 83666. [2024-11-10 01:00:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83666 states, 83664 states have (on average 1.4392092178236757) internal successors, (120410), 83665 states have internal predecessors, (120410), 0 states have call successors, (0), 0 states have 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:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83666 states to 83666 states and 120410 transitions. [2024-11-10 01:00:23,813 INFO L78 Accepts]: Start accepts. Automaton has 83666 states and 120410 transitions. Word has length 108 [2024-11-10 01:00:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:23,814 INFO L471 AbstractCegarLoop]: Abstraction has 83666 states and 120410 transitions. [2024-11-10 01:00:23,814 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:00:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 83666 states and 120410 transitions. [2024-11-10 01:00:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:00:23,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:23,831 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:00:23,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:00:23,831 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:23,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1273713121, now seen corresponding path program 1 times [2024-11-10 01:00:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753981072] [2024-11-10 01:00:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:23,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:24,079 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:00:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:24,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753981072] [2024-11-10 01:00:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753981072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:24,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:24,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:00:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820030698] [2024-11-10 01:00:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:24,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:00:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:24,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:00:24,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:00:24,082 INFO L87 Difference]: Start difference. First operand 83666 states and 120410 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:00:28,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:28,022 INFO L93 Difference]: Finished difference Result 188394 states and 269418 transitions. [2024-11-10 01:00:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:00:28,023 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:00:28,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:28,272 INFO L225 Difference]: With dead ends: 188394 [2024-11-10 01:00:28,272 INFO L226 Difference]: Without dead ends: 172775 [2024-11-10 01:00:28,329 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:00:28,330 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:00:28,330 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:00:28,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172775 states. [2024-11-10 01:00:31,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172775 to 99282. [2024-11-10 01:00:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99282 states, 99280 states have (on average 1.4345890410958904) internal successors, (142426), 99281 states have internal predecessors, (142426), 0 states have call successors, (0), 0 states have 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:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99282 states to 99282 states and 142426 transitions. [2024-11-10 01:00:32,213 INFO L78 Accepts]: Start accepts. Automaton has 99282 states and 142426 transitions. Word has length 108 [2024-11-10 01:00:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:32,214 INFO L471 AbstractCegarLoop]: Abstraction has 99282 states and 142426 transitions. [2024-11-10 01:00:32,214 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:00:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 99282 states and 142426 transitions. [2024-11-10 01:00:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:00:32,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:32,227 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:00:32,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:00:32,232 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:32,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash -929651423, now seen corresponding path program 1 times [2024-11-10 01:00:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:32,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189880532] [2024-11-10 01:00:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:32,452 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:00:32,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189880532] [2024-11-10 01:00:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189880532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:32,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:00:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211522341] [2024-11-10 01:00:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:32,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:00:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:00:32,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:00:32,455 INFO L87 Difference]: Start difference. First operand 99282 states and 142426 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)