./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.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.UNBOUNDED.pals+Problem12_label09.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 c2b92f7b268935cb0637cec19294e5d3b9c96e09bf4c6f56efedf9d49b1a49f7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:00:33,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:00:33,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 01:00:33,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:00:33,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:00:33,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:00:33,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:00:33,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:00:33,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:00:33,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:00:33,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:00:33,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:00:33,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:00:33,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:00:33,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:00:33,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:00:33,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:00:33,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 01:00:33,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:00:33,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 01:00:33,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:00:33,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:00:33,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:00:33,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:00:33,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:00:33,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 01:00:33,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:00:33,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:00:33,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:00:33,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:00:33,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:00:33,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:00:33,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:00:33,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:00:33,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:00:33,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:00:33,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:00:33,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:00:33,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:00:33,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:00:33,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:00:33,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:00:33,802 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 -> c2b92f7b268935cb0637cec19294e5d3b9c96e09bf4c6f56efedf9d49b1a49f7 [2024-11-10 01:00:34,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:00:34,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:00:34,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:00:34,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:00:34,075 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:00:34,076 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.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 01:00:35,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:00:35,706 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:00:35,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 01:00:35,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f73a36d/693ec293be054315ae89f056c895c9dd/FLAG6cc49352c [2024-11-10 01:00:35,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f73a36d/693ec293be054315ae89f056c895c9dd [2024-11-10 01:00:35,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:00:35,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:00:35,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:00:35,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:00:35,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:00:35,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:35" (1/1) ... [2024-11-10 01:00:35,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1535d067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:35, skipping insertion in model container [2024-11-10 01:00:35,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:35" (1/1) ... [2024-11-10 01:00:36,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:00:36,395 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.UNBOUNDED.pals+Problem12_label09.c[20491,20504] [2024-11-10 01:00:36,456 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.UNBOUNDED.pals+Problem12_label09.c[28239,28252] [2024-11-10 01:00:36,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:00:36,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:00:37,001 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.UNBOUNDED.pals+Problem12_label09.c[20491,20504] [2024-11-10 01:00:37,008 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.UNBOUNDED.pals+Problem12_label09.c[28239,28252] [2024-11-10 01:00:37,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:00:37,315 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:00:37,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37 WrapperNode [2024-11-10 01:00:37,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:00:37,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:00:37,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:00:37,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:00:37,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:37,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:37,652 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5218 [2024-11-10 01:00:37,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:00:37,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:00:37,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:00:37,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:00:37,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:37,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:37,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:37,800 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:00:37,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:37,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:37,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:37,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:38,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:38,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:38,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:00:38,157 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:00:38,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:00:38,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:00:38,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (1/1) ... [2024-11-10 01:00:38,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:00:38,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:00:38,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:00:38,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:00:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:00:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:00:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:00:38,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:00:38,317 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:00:38,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:00:42,788 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5258: havoc calculate_output3_#t~ret47#1; [2024-11-10 01:00:42,789 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2289: havoc calculate_output_#t~ret45#1; [2024-11-10 01:00:42,789 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3768: havoc calculate_output2_#t~ret46#1; [2024-11-10 01:00:43,038 INFO L? ?]: Removed 2091 outVars from TransFormulas that were not future-live. [2024-11-10 01:00:43,039 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:00:43,080 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:00:43,080 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:00:43,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:00:43 BoogieIcfgContainer [2024-11-10 01:00:43,081 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:00:43,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:00:43,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:00:43,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:00:43,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:00:35" (1/3) ... [2024-11-10 01:00:43,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620f28be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:00:43, skipping insertion in model container [2024-11-10 01:00:43,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:37" (2/3) ... [2024-11-10 01:00:43,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620f28be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:00:43, skipping insertion in model container [2024-11-10 01:00:43,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:00:43" (3/3) ... [2024-11-10 01:00:43,091 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 01:00:43,106 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:00:43,106 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 01:00:43,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:00:43,202 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;@36957cce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:00:43,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 01:00:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 939 states, 936 states have (on average 2.622863247863248) internal successors, (2455), 938 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have 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:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 01:00:43,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:43,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:43,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:43,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1060095836, now seen corresponding path program 1 times [2024-11-10 01:00:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:43,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383927652] [2024-11-10 01:00:43,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:43,486 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:43,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383927652] [2024-11-10 01:00:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383927652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:43,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:43,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:00:43,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080383127] [2024-11-10 01:00:43,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:43,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:00:43,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:43,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:00:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:00:43,520 INFO L87 Difference]: Start difference. First operand has 939 states, 936 states have (on average 2.622863247863248) internal successors, (2455), 938 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:43,587 INFO L93 Difference]: Finished difference Result 1818 states and 4798 transitions. [2024-11-10 01:00:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:00:43,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 01:00:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:43,612 INFO L225 Difference]: With dead ends: 1818 [2024-11-10 01:00:43,612 INFO L226 Difference]: Without dead ends: 871 [2024-11-10 01:00:43,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:00:43,620 INFO L432 NwaCegarLoop]: 2384 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:43,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:00:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-10 01:00:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2024-11-10 01:00:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 869 states have (on average 2.669735327963176) internal successors, (2320), 870 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have 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:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2320 transitions. [2024-11-10 01:00:43,719 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2320 transitions. Word has length 30 [2024-11-10 01:00:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:43,720 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 2320 transitions. [2024-11-10 01:00:43,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2320 transitions. [2024-11-10 01:00:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 01:00:43,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:43,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:43,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:00:43,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:43,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1127102589, now seen corresponding path program 1 times [2024-11-10 01:00:43,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441920766] [2024-11-10 01:00:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:43,918 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:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441920766] [2024-11-10 01:00:43,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441920766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:43,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:43,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:00:43,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837355959] [2024-11-10 01:00:43,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:43,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:00:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:43,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:00:43,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:00:43,921 INFO L87 Difference]: Start difference. First operand 871 states and 2320 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:44,051 INFO L93 Difference]: Finished difference Result 934 states and 2417 transitions. [2024-11-10 01:00:44,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:00:44,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 01:00:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:44,055 INFO L225 Difference]: With dead ends: 934 [2024-11-10 01:00:44,055 INFO L226 Difference]: Without dead ends: 871 [2024-11-10 01:00:44,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:00:44,057 INFO L432 NwaCegarLoop]: 2318 mSDtfsCounter, 0 mSDsluCounter, 6899 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9217 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:44,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9217 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:00:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-10 01:00:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2024-11-10 01:00:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 869 states have (on average 2.6121979286536248) internal successors, (2270), 870 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have 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:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2270 transitions. [2024-11-10 01:00:44,076 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2270 transitions. Word has length 30 [2024-11-10 01:00:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:44,076 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 2270 transitions. [2024-11-10 01:00:44,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2270 transitions. [2024-11-10 01:00:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 01:00:44,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:44,080 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] [2024-11-10 01:00:44,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:00:44,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:44,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:44,084 INFO L85 PathProgramCache]: Analyzing trace with hash -739010594, now seen corresponding path program 1 times [2024-11-10 01:00:44,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:44,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111276152] [2024-11-10 01:00:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:44,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:44,244 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:44,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:44,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111276152] [2024-11-10 01:00:44,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111276152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:44,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:44,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:44,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101922184] [2024-11-10 01:00:44,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:44,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:00:44,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:44,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:00:44,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:00:44,247 INFO L87 Difference]: Start difference. First operand 871 states and 2270 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:51,190 INFO L93 Difference]: Finished difference Result 3130 states and 8623 transitions. [2024-11-10 01:00:51,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:00:51,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-10 01:00:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:51,205 INFO L225 Difference]: With dead ends: 3130 [2024-11-10 01:00:51,205 INFO L226 Difference]: Without dead ends: 2375 [2024-11-10 01:00:51,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:00:51,208 INFO L432 NwaCegarLoop]: 844 mSDtfsCounter, 4525 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:51,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 867 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-10 01:00:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2024-11-10 01:00:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2375. [2024-11-10 01:00:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2373 states have (on average 2.363253265908133) internal successors, (5608), 2374 states have internal predecessors, (5608), 0 states have call successors, (0), 0 states have 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:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 5608 transitions. [2024-11-10 01:00:51,277 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 5608 transitions. Word has length 69 [2024-11-10 01:00:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:51,278 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 5608 transitions. [2024-11-10 01:00:51,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 5608 transitions. [2024-11-10 01:00:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 01:00:51,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:51,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:51,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:00:51,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:51,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1437015884, now seen corresponding path program 1 times [2024-11-10 01:00:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:51,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081956072] [2024-11-10 01:00:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:51,561 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:51,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:51,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081956072] [2024-11-10 01:00:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081956072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:51,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:00:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241467809] [2024-11-10 01:00:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:51,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:00:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:51,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:00:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:00:51,563 INFO L87 Difference]: Start difference. First operand 2375 states and 5608 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:51,870 INFO L93 Difference]: Finished difference Result 3201 states and 6910 transitions. [2024-11-10 01:00:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 01:00:51,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-10 01:00:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:51,883 INFO L225 Difference]: With dead ends: 3201 [2024-11-10 01:00:51,884 INFO L226 Difference]: Without dead ends: 3142 [2024-11-10 01:00:51,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-10 01:00:51,886 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 16434 mSDsluCounter, 2692 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16434 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:51,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16434 Valid, 4956 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:00:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2024-11-10 01:00:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 2431. [2024-11-10 01:00:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2429 states have (on average 2.3454096335940715) internal successors, (5697), 2430 states have internal predecessors, (5697), 0 states have call successors, (0), 0 states have 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:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 5697 transitions. [2024-11-10 01:00:51,936 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 5697 transitions. Word has length 79 [2024-11-10 01:00:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:51,937 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 5697 transitions. [2024-11-10 01:00:51,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 5697 transitions. [2024-11-10 01:00:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 01:00:51,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:51,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:51,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:00:51,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:51,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:51,940 INFO L85 PathProgramCache]: Analyzing trace with hash 282155758, now seen corresponding path program 1 times [2024-11-10 01:00:51,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:51,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742287822] [2024-11-10 01:00:51,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:51,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:52,340 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:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742287822] [2024-11-10 01:00:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742287822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:52,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:52,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:00:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881169934] [2024-11-10 01:00:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:52,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:00:52,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:52,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:00:52,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:00:52,343 INFO L87 Difference]: Start difference. First operand 2431 states and 5697 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:52,650 INFO L93 Difference]: Finished difference Result 2549 states and 5881 transitions. [2024-11-10 01:00:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:00:52,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 01:00:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:52,659 INFO L225 Difference]: With dead ends: 2549 [2024-11-10 01:00:52,660 INFO L226 Difference]: Without dead ends: 2434 [2024-11-10 01:00:52,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-10 01:00:52,661 INFO L432 NwaCegarLoop]: 2261 mSDtfsCounter, 15362 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15362 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:52,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15362 Valid, 2801 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:00:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2024-11-10 01:00:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2431. [2024-11-10 01:00:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2429 states have (on average 2.344997941539728) internal successors, (5696), 2430 states have internal predecessors, (5696), 0 states have call successors, (0), 0 states have 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:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 5696 transitions. [2024-11-10 01:00:52,705 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 5696 transitions. Word has length 81 [2024-11-10 01:00:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:52,705 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 5696 transitions. [2024-11-10 01:00:52,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 5696 transitions. [2024-11-10 01:00:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 01:00:52,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:52,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:52,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:00:52,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:52,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1880713111, now seen corresponding path program 1 times [2024-11-10 01:00:52,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:52,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126734316] [2024-11-10 01:00:52,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:52,776 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:52,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:52,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126734316] [2024-11-10 01:00:52,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126734316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:52,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:52,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:52,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013670431] [2024-11-10 01:00:52,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:52,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:52,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:52,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:52,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:52,779 INFO L87 Difference]: Start difference. First operand 2431 states and 5696 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:52,820 INFO L93 Difference]: Finished difference Result 2649 states and 6038 transitions. [2024-11-10 01:00:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:52,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-10 01:00:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:52,829 INFO L225 Difference]: With dead ends: 2649 [2024-11-10 01:00:52,829 INFO L226 Difference]: Without dead ends: 2534 [2024-11-10 01:00:52,831 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:52,831 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 2184 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:52,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 2352 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:00:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2024-11-10 01:00:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2529. [2024-11-10 01:00:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2527 states have (on average 2.3142065690542144) internal successors, (5848), 2528 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have 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:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 5848 transitions. [2024-11-10 01:00:52,878 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 5848 transitions. Word has length 82 [2024-11-10 01:00:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:52,879 INFO L471 AbstractCegarLoop]: Abstraction has 2529 states and 5848 transitions. [2024-11-10 01:00:52,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 5848 transitions. [2024-11-10 01:00:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:00:52,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:52,880 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:52,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:00:52,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:52,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:52,881 INFO L85 PathProgramCache]: Analyzing trace with hash -613981456, now seen corresponding path program 1 times [2024-11-10 01:00:52,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:52,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777338008] [2024-11-10 01:00:52,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:52,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:52,984 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:52,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:52,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777338008] [2024-11-10 01:00:52,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777338008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:52,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:52,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:52,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353047591] [2024-11-10 01:00:52,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:52,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:52,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:52,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:52,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:52,987 INFO L87 Difference]: Start difference. First operand 2529 states and 5848 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:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:53,020 INFO L93 Difference]: Finished difference Result 2939 states and 6486 transitions. [2024-11-10 01:00:53,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:53,020 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:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:53,029 INFO L225 Difference]: With dead ends: 2939 [2024-11-10 01:00:53,030 INFO L226 Difference]: Without dead ends: 2726 [2024-11-10 01:00:53,031 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:53,032 INFO L432 NwaCegarLoop]: 2339 mSDtfsCounter, 2201 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 2437 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:53,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2201 Valid, 2437 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:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2024-11-10 01:00:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2723. [2024-11-10 01:00:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2721 states have (on average 2.25909592061742) internal successors, (6147), 2722 states have internal predecessors, (6147), 0 states have call successors, (0), 0 states have 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:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 6147 transitions. [2024-11-10 01:00:53,081 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 6147 transitions. Word has length 83 [2024-11-10 01:00:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:53,081 INFO L471 AbstractCegarLoop]: Abstraction has 2723 states and 6147 transitions. [2024-11-10 01:00:53,081 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:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 6147 transitions. [2024-11-10 01:00:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:00:53,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:53,082 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:53,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:00:53,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:53,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:53,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1386522256, now seen corresponding path program 1 times [2024-11-10 01:00:53,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:53,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36557757] [2024-11-10 01:00:53,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:53,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:53,135 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:53,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:53,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36557757] [2024-11-10 01:00:53,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36557757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:53,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:53,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:53,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14416715] [2024-11-10 01:00:53,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:53,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:53,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:53,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:53,137 INFO L87 Difference]: Start difference. First operand 2723 states and 6147 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:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:53,170 INFO L93 Difference]: Finished difference Result 3505 states and 7355 transitions. [2024-11-10 01:00:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:53,170 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:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:53,180 INFO L225 Difference]: With dead ends: 3505 [2024-11-10 01:00:53,180 INFO L226 Difference]: Without dead ends: 3098 [2024-11-10 01:00:53,182 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:53,182 INFO L432 NwaCegarLoop]: 2327 mSDtfsCounter, 2197 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 2433 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:53,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 2433 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:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2024-11-10 01:00:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3095. [2024-11-10 01:00:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 3093 states have (on average 2.170384739734885) internal successors, (6713), 3094 states have internal predecessors, (6713), 0 states have call successors, (0), 0 states have 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:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 6713 transitions. [2024-11-10 01:00:53,250 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 6713 transitions. Word has length 83 [2024-11-10 01:00:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:53,250 INFO L471 AbstractCegarLoop]: Abstraction has 3095 states and 6713 transitions. [2024-11-10 01:00:53,250 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:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 6713 transitions. [2024-11-10 01:00:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:00:53,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:53,251 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:53,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:00:53,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:53,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1907035312, now seen corresponding path program 1 times [2024-11-10 01:00:53,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:53,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869363863] [2024-11-10 01:00:53,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:53,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:53,305 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:53,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869363863] [2024-11-10 01:00:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869363863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:53,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:53,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:53,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061558096] [2024-11-10 01:00:53,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:53,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:53,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:53,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:53,307 INFO L87 Difference]: Start difference. First operand 3095 states and 6713 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:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:53,348 INFO L93 Difference]: Finished difference Result 4589 states and 8997 transitions. [2024-11-10 01:00:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:53,349 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:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:53,365 INFO L225 Difference]: With dead ends: 4589 [2024-11-10 01:00:53,367 INFO L226 Difference]: Without dead ends: 3810 [2024-11-10 01:00:53,369 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:53,369 INFO L432 NwaCegarLoop]: 2325 mSDtfsCounter, 2195 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 2435 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:53,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2195 Valid, 2435 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:53,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2024-11-10 01:00:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3807. [2024-11-10 01:00:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3807 states, 3805 states have (on average 2.044940867279895) internal successors, (7781), 3806 states have internal predecessors, (7781), 0 states have call successors, (0), 0 states have 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:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 7781 transitions. [2024-11-10 01:00:53,439 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 7781 transitions. Word has length 83 [2024-11-10 01:00:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:53,439 INFO L471 AbstractCegarLoop]: Abstraction has 3807 states and 7781 transitions. [2024-11-10 01:00:53,440 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:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 7781 transitions. [2024-11-10 01:00:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:00:53,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:53,441 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:53,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:00:53,441 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:53,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1892585456, now seen corresponding path program 1 times [2024-11-10 01:00:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144371023] [2024-11-10 01:00:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:53,489 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:53,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:53,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144371023] [2024-11-10 01:00:53,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144371023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:53,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:53,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:53,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616022829] [2024-11-10 01:00:53,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:53,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:53,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:53,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:53,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:53,491 INFO L87 Difference]: Start difference. First operand 3807 states and 7781 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:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:53,549 INFO L93 Difference]: Finished difference Result 6661 states and 12089 transitions. [2024-11-10 01:00:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:53,549 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:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:53,559 INFO L225 Difference]: With dead ends: 6661 [2024-11-10 01:00:53,559 INFO L226 Difference]: Without dead ends: 5170 [2024-11-10 01:00:53,563 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:53,564 INFO L432 NwaCegarLoop]: 2323 mSDtfsCounter, 2193 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 2437 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:53,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 2437 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:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5170 states. [2024-11-10 01:00:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5170 to 5167. [2024-11-10 01:00:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5167 states, 5165 states have (on average 1.8952565343659245) internal successors, (9789), 5166 states have internal predecessors, (9789), 0 states have call successors, (0), 0 states have 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:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 9789 transitions. [2024-11-10 01:00:53,668 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 9789 transitions. Word has length 83 [2024-11-10 01:00:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:53,668 INFO L471 AbstractCegarLoop]: Abstraction has 5167 states and 9789 transitions. [2024-11-10 01:00:53,668 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:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 9789 transitions. [2024-11-10 01:00:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:00:53,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:53,669 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:53,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:00:53,670 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:53,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:53,670 INFO L85 PathProgramCache]: Analyzing trace with hash -310779088, now seen corresponding path program 1 times [2024-11-10 01:00:53,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:53,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053483880] [2024-11-10 01:00:53,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:53,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:53,728 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:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053483880] [2024-11-10 01:00:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053483880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:53,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423064948] [2024-11-10 01:00:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:53,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:53,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:53,730 INFO L87 Difference]: Start difference. First operand 5167 states and 9789 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:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:53,866 INFO L93 Difference]: Finished difference Result 10613 states and 17889 transitions. [2024-11-10 01:00:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:53,867 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:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:53,880 INFO L225 Difference]: With dead ends: 10613 [2024-11-10 01:00:53,880 INFO L226 Difference]: Without dead ends: 7762 [2024-11-10 01:00:53,884 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:53,885 INFO L432 NwaCegarLoop]: 2321 mSDtfsCounter, 2191 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 2439 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:53,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 2439 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:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2024-11-10 01:00:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 7759. [2024-11-10 01:00:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7759 states, 7757 states have (on average 1.7466804176872501) internal successors, (13549), 7758 states have internal predecessors, (13549), 0 states have call successors, (0), 0 states have 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:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7759 states to 7759 states and 13549 transitions. [2024-11-10 01:00:54,097 INFO L78 Accepts]: Start accepts. Automaton has 7759 states and 13549 transitions. Word has length 83 [2024-11-10 01:00:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:54,098 INFO L471 AbstractCegarLoop]: Abstraction has 7759 states and 13549 transitions. [2024-11-10 01:00:54,098 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:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 7759 states and 13549 transitions. [2024-11-10 01:00:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:00:54,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:54,099 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:54,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:00:54,100 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:54,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash -835056143, now seen corresponding path program 1 times [2024-11-10 01:00:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:54,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28281958] [2024-11-10 01:00:54,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:54,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:54,401 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:54,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28281958] [2024-11-10 01:00:54,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28281958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:54,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:54,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:00:54,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846427371] [2024-11-10 01:00:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:54,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:00:54,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:00:54,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:00:54,404 INFO L87 Difference]: Start difference. First operand 7759 states and 13549 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:54,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:54,555 INFO L93 Difference]: Finished difference Result 7954 states and 13807 transitions. [2024-11-10 01:00:54,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:00:54,556 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:54,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:54,570 INFO L225 Difference]: With dead ends: 7954 [2024-11-10 01:00:54,570 INFO L226 Difference]: Without dead ends: 7951 [2024-11-10 01:00:54,574 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:54,575 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 0 mSDsluCounter, 13571 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15835 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:54,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15835 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:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7951 states. [2024-11-10 01:00:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7951 to 7951. [2024-11-10 01:00:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7951 states, 7949 states have (on average 1.724619448987294) internal successors, (13709), 7950 states have internal predecessors, (13709), 0 states have call successors, (0), 0 states have 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:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7951 states to 7951 states and 13709 transitions. [2024-11-10 01:00:54,713 INFO L78 Accepts]: Start accepts. Automaton has 7951 states and 13709 transitions. Word has length 83 [2024-11-10 01:00:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:54,713 INFO L471 AbstractCegarLoop]: Abstraction has 7951 states and 13709 transitions. [2024-11-10 01:00:54,714 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:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 7951 states and 13709 transitions. [2024-11-10 01:00:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:00:54,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:54,714 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:54,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:00:54,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:54,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1104447952, now seen corresponding path program 1 times [2024-11-10 01:00:54,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:54,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462121585] [2024-11-10 01:00:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:54,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:54,775 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:54,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:54,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462121585] [2024-11-10 01:00:54,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462121585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:54,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:54,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:54,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577352363] [2024-11-10 01:00:54,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:54,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:54,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:54,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:54,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:54,778 INFO L87 Difference]: Start difference. First operand 7951 states and 13709 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:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:54,906 INFO L93 Difference]: Finished difference Result 18709 states and 29201 transitions. [2024-11-10 01:00:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:54,906 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:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:54,929 INFO L225 Difference]: With dead ends: 18709 [2024-11-10 01:00:54,929 INFO L226 Difference]: Without dead ends: 13074 [2024-11-10 01:00:54,938 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:54,940 INFO L432 NwaCegarLoop]: 2337 mSDtfsCounter, 2199 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2199 SdHoareTripleChecker+Valid, 2439 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:54,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2199 Valid, 2439 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:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13074 states. [2024-11-10 01:00:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13074 to 13071. [2024-11-10 01:00:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13071 states, 13069 states have (on average 1.5974443339199633) internal successors, (20877), 13070 states have internal predecessors, (20877), 0 states have call successors, (0), 0 states have 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:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13071 states to 13071 states and 20877 transitions. [2024-11-10 01:00:55,243 INFO L78 Accepts]: Start accepts. Automaton has 13071 states and 20877 transitions. Word has length 83 [2024-11-10 01:00:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:55,243 INFO L471 AbstractCegarLoop]: Abstraction has 13071 states and 20877 transitions. [2024-11-10 01:00:55,243 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:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 13071 states and 20877 transitions. [2024-11-10 01:00:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 01:00:55,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:55,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:55,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:00:55,245 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:55,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash 410277008, now seen corresponding path program 1 times [2024-11-10 01:00:55,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:55,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037695101] [2024-11-10 01:00:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:55,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:55,304 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:55,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037695101] [2024-11-10 01:00:55,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037695101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:55,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:55,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:55,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391549589] [2024-11-10 01:00:55,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:55,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:55,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:55,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:55,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:55,306 INFO L87 Difference]: Start difference. First operand 13071 states and 20877 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:55,497 INFO L93 Difference]: Finished difference Result 24345 states and 37142 transitions. [2024-11-10 01:00:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:55,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-10 01:00:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:55,531 INFO L225 Difference]: With dead ends: 24345 [2024-11-10 01:00:55,532 INFO L226 Difference]: Without dead ends: 18325 [2024-11-10 01:00:55,545 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:55,546 INFO L432 NwaCegarLoop]: 2344 mSDtfsCounter, 2200 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:55,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 2438 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:00:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2024-11-10 01:00:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 18322. [2024-11-10 01:00:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18322 states, 18320 states have (on average 1.5414847161572052) internal successors, (28240), 18321 states have internal predecessors, (28240), 0 states have call successors, (0), 0 states have 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:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18322 states to 18322 states and 28240 transitions. [2024-11-10 01:00:56,036 INFO L78 Accepts]: Start accepts. Automaton has 18322 states and 28240 transitions. Word has length 85 [2024-11-10 01:00:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:56,036 INFO L471 AbstractCegarLoop]: Abstraction has 18322 states and 28240 transitions. [2024-11-10 01:00:56,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 18322 states and 28240 transitions. [2024-11-10 01:00:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:00:56,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:56,041 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:56,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:00:56,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:56,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1965372354, now seen corresponding path program 1 times [2024-11-10 01:00:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:56,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817174859] [2024-11-10 01:00:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:56,236 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:56,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:56,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817174859] [2024-11-10 01:00:56,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817174859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:56,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:56,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:00:56,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065100714] [2024-11-10 01:00:56,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:56,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:00:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:56,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:00:56,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:00:56,238 INFO L87 Difference]: Start difference. First operand 18322 states and 28240 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:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:57,769 INFO L93 Difference]: Finished difference Result 133674 states and 191840 transitions. [2024-11-10 01:00:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:00:57,770 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:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:58,040 INFO L225 Difference]: With dead ends: 133674 [2024-11-10 01:00:58,041 INFO L226 Difference]: Without dead ends: 117671 [2024-11-10 01:00:58,092 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:58,093 INFO L432 NwaCegarLoop]: 2366 mSDtfsCounter, 14021 mSDsluCounter, 3433 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14021 SdHoareTripleChecker+Valid, 5799 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:58,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14021 Valid, 5799 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:00:58,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117671 states. [2024-11-10 01:00:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117671 to 34322. [2024-11-10 01:00:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34322 states, 34320 states have (on average 1.4792540792540791) internal successors, (50768), 34321 states have internal predecessors, (50768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34322 states to 34322 states and 50768 transitions. [2024-11-10 01:00:59,555 INFO L78 Accepts]: Start accepts. Automaton has 34322 states and 50768 transitions. Word has length 108 [2024-11-10 01:00:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:59,556 INFO L471 AbstractCegarLoop]: Abstraction has 34322 states and 50768 transitions. [2024-11-10 01:00:59,556 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:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 34322 states and 50768 transitions. [2024-11-10 01:00:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:00:59,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:59,562 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:59,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:00:59,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:59,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1557054142, now seen corresponding path program 1 times [2024-11-10 01:00:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:59,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806370639] [2024-11-10 01:00:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:59,779 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:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806370639] [2024-11-10 01:00:59,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806370639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:59,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:59,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:00:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000198451] [2024-11-10 01:00:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:59,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:00:59,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:00:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:00:59,782 INFO L87 Difference]: Start difference. First operand 34322 states and 50768 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:01,767 INFO L93 Difference]: Finished difference Result 149674 states and 214368 transitions. [2024-11-10 01:01:01,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:01,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:01:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:01,999 INFO L225 Difference]: With dead ends: 149674 [2024-11-10 01:01:02,000 INFO L226 Difference]: Without dead ends: 133671 [2024-11-10 01:01:02,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:02,032 INFO L432 NwaCegarLoop]: 2362 mSDtfsCounter, 14073 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14073 SdHoareTripleChecker+Valid, 5740 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:02,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14073 Valid, 5740 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133671 states. [2024-11-10 01:01:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133671 to 58386. [2024-11-10 01:01:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58386 states, 58384 states have (on average 1.4461496300356262) internal successors, (84432), 58385 states have internal predecessors, (84432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58386 states to 58386 states and 84432 transitions. [2024-11-10 01:01:04,621 INFO L78 Accepts]: Start accepts. Automaton has 58386 states and 84432 transitions. Word has length 108 [2024-11-10 01:01:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:04,622 INFO L471 AbstractCegarLoop]: Abstraction has 58386 states and 84432 transitions. [2024-11-10 01:01:04,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 58386 states and 84432 transitions. [2024-11-10 01:01:04,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:04,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:04,629 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:04,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:01:04,629 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:04,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash 555644414, now seen corresponding path program 1 times [2024-11-10 01:01:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:04,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373835872] [2024-11-10 01:01:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:04,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 01:01:04,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373835872] [2024-11-10 01:01:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373835872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:04,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:04,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:04,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042051256] [2024-11-10 01:01:04,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:04,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:04,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:04,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:04,806 INFO L87 Difference]: Start difference. First operand 58386 states and 84432 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:07,638 INFO L93 Difference]: Finished difference Result 165674 states and 236896 transitions. [2024-11-10 01:01:07,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:07,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:01:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:07,867 INFO L225 Difference]: With dead ends: 165674 [2024-11-10 01:01:07,867 INFO L226 Difference]: Without dead ends: 149671 [2024-11-10 01:01:07,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:07,910 INFO L432 NwaCegarLoop]: 2358 mSDtfsCounter, 14133 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14133 SdHoareTripleChecker+Valid, 5649 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:07,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14133 Valid, 5649 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:08,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149671 states. [2024-11-10 01:01:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149671 to 74386. [2024-11-10 01:01:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74386 states, 74384 states have (on average 1.4379436437943645) internal successors, (106960), 74385 states have internal predecessors, (106960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74386 states to 74386 states and 106960 transitions. [2024-11-10 01:01:10,497 INFO L78 Accepts]: Start accepts. Automaton has 74386 states and 106960 transitions. Word has length 108 [2024-11-10 01:01:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:10,497 INFO L471 AbstractCegarLoop]: Abstraction has 74386 states and 106960 transitions. [2024-11-10 01:01:10,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 74386 states and 106960 transitions. [2024-11-10 01:01:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:10,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:10,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:10,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:01:10,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:10,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:10,505 INFO L85 PathProgramCache]: Analyzing trace with hash 541194558, now seen corresponding path program 1 times [2024-11-10 01:01:10,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:10,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868190906] [2024-11-10 01:01:10,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:10,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 01:01:10,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:10,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868190906] [2024-11-10 01:01:10,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868190906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:10,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937917651] [2024-11-10 01:01:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:10,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:10,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:10,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:10,729 INFO L87 Difference]: Start difference. First operand 74386 states and 106960 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:14,264 INFO L93 Difference]: Finished difference Result 181674 states and 259424 transitions. [2024-11-10 01:01:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:14,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:01:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:14,686 INFO L225 Difference]: With dead ends: 181674 [2024-11-10 01:01:14,687 INFO L226 Difference]: Without dead ends: 165671 [2024-11-10 01:01:14,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:14,726 INFO L432 NwaCegarLoop]: 2354 mSDtfsCounter, 14199 mSDsluCounter, 3280 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14199 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:14,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14199 Valid, 5634 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165671 states. [2024-11-10 01:01:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165671 to 90386. [2024-11-10 01:01:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90386 states, 90384 states have (on average 1.432642945654098) internal successors, (129488), 90385 states have internal predecessors, (129488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90386 states to 90386 states and 129488 transitions. [2024-11-10 01:01:18,023 INFO L78 Accepts]: Start accepts. Automaton has 90386 states and 129488 transitions. Word has length 108 [2024-11-10 01:01:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:18,023 INFO L471 AbstractCegarLoop]: Abstraction has 90386 states and 129488 transitions. [2024-11-10 01:01:18,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 90386 states and 129488 transitions. [2024-11-10 01:01:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:18,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:18,032 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:18,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:01:18,032 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:18,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1662169986, now seen corresponding path program 1 times [2024-11-10 01:01:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:18,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173530672] [2024-11-10 01:01:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 01:01:18,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:18,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173530672] [2024-11-10 01:01:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173530672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:18,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:18,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041703279] [2024-11-10 01:01:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:18,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:18,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:18,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:18,201 INFO L87 Difference]: Start difference. First operand 90386 states and 129488 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:22,188 INFO L93 Difference]: Finished difference Result 197674 states and 281952 transitions. [2024-11-10 01:01:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:22,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:01:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:22,604 INFO L225 Difference]: With dead ends: 197674 [2024-11-10 01:01:22,604 INFO L226 Difference]: Without dead ends: 181671 [2024-11-10 01:01:22,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:22,641 INFO L432 NwaCegarLoop]: 2363 mSDtfsCounter, 14034 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14034 SdHoareTripleChecker+Valid, 5793 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:22,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14034 Valid, 5793 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181671 states. [2024-11-10 01:01:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181671 to 106386. [2024-11-10 01:01:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106386 states, 106384 states have (on average 1.4289366822078509) internal successors, (152016), 106385 states have internal predecessors, (152016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106386 states to 106386 states and 152016 transitions. [2024-11-10 01:01:26,246 INFO L78 Accepts]: Start accepts. Automaton has 106386 states and 152016 transitions. Word has length 108 [2024-11-10 01:01:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:26,246 INFO L471 AbstractCegarLoop]: Abstraction has 106386 states and 152016 transitions. [2024-11-10 01:01:26,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 106386 states and 152016 transitions. [2024-11-10 01:01:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:26,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:26,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:26,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:01:26,253 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:26,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:26,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1839128446, now seen corresponding path program 1 times [2024-11-10 01:01:26,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:26,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318138625] [2024-11-10 01:01:26,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:26,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 01:01:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:26,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318138625] [2024-11-10 01:01:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318138625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359224410] [2024-11-10 01:01:26,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:26,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:26,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:26,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:26,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:26,409 INFO L87 Difference]: Start difference. First operand 106386 states and 152016 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)