./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.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.6.ufo.UNBOUNDED.pals+Problem12_label07.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 2ebc8d28b42c51bdeaffef49b8259d7ab2c7e002b024bef1fa6cab620a98975e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:59:04,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:59:04,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:59:04,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:59:04,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:59:04,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:59:04,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:59:04,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:59:04,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:59:04,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:59:04,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:59:04,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:59:04,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:59:04,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:59:04,675 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:59:04,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:59:04,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:59:04,676 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:59:04,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:59:04,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:59:04,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:59:04,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:59:04,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:59:04,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:59:04,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:59:04,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:59:04,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:59:04,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:59:04,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:59:04,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:59:04,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:59:04,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:59:04,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:59:04,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:59:04,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:59:04,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:59:04,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:59:04,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:59:04,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:59:04,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:59:04,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:59:04,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:59:04,684 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 -> 2ebc8d28b42c51bdeaffef49b8259d7ab2c7e002b024bef1fa6cab620a98975e [2024-11-10 00:59:04,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:59:05,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:59:05,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:59:05,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:59:05,023 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:59:05,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-11-10 00:59:06,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:59:07,044 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:59:07,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-11-10 00:59:07,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0e6eb299/90d2edca55914c0f88f2c00364102ff6/FLAGd9585e585 [2024-11-10 00:59:07,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0e6eb299/90d2edca55914c0f88f2c00364102ff6 [2024-11-10 00:59:07,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:59:07,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:59:07,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:59:07,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:59:07,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:59:07,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:07" (1/1) ... [2024-11-10 00:59:07,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67265ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:07, skipping insertion in model container [2024-11-10 00:59:07,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:07" (1/1) ... [2024-11-10 00:59:07,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:59:07,758 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.6.ufo.UNBOUNDED.pals+Problem12_label07.c[15510,15523] [2024-11-10 00:59:07,811 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.6.ufo.UNBOUNDED.pals+Problem12_label07.c[16352,16365] [2024-11-10 00:59:08,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:59:08,882 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:59:08,917 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.6.ufo.UNBOUNDED.pals+Problem12_label07.c[15510,15523] [2024-11-10 00:59:08,923 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.6.ufo.UNBOUNDED.pals+Problem12_label07.c[16352,16365] [2024-11-10 00:59:09,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:59:09,203 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:59:09,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09 WrapperNode [2024-11-10 00:59:09,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:59:09,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:59:09,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:59:09,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:59:09,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:09,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:09,487 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5155 [2024-11-10 00:59:09,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:59:09,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:59:09,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:59:09,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:59:09,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:09,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:09,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:09,833 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:59:09,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:09,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:09,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:09,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:09,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:09,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:10,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:59:10,142 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:59:10,142 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:59:10,142 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:59:10,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (1/1) ... [2024-11-10 00:59:10,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:59:10,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:59:10,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:59:10,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:59:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:59:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:59:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:59:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:59:10,332 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:59:10,335 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:59:15,347 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3685: havoc calculate_output2_#t~ret42#1; [2024-11-10 00:59:15,348 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5175: havoc calculate_output3_#t~ret43#1; [2024-11-10 00:59:15,348 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: havoc calculate_output_#t~ret41#1; [2024-11-10 00:59:15,707 INFO L? ?]: Removed 2086 outVars from TransFormulas that were not future-live. [2024-11-10 00:59:15,708 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:59:15,743 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:59:15,744 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:59:15,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:59:15 BoogieIcfgContainer [2024-11-10 00:59:15,744 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:59:15,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:59:15,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:59:15,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:59:15,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:59:07" (1/3) ... [2024-11-10 00:59:15,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb41d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:59:15, skipping insertion in model container [2024-11-10 00:59:15,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:09" (2/3) ... [2024-11-10 00:59:15,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb41d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:59:15, skipping insertion in model container [2024-11-10 00:59:15,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:59:15" (3/3) ... [2024-11-10 00:59:15,758 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-11-10 00:59:15,789 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:59:15,789 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:59:15,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:59:15,881 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;@1b2c8e31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:59:15,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:59:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 923 states, 920 states have (on average 2.635869565217391) internal successors, (2425), 922 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 00:59:15,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:15,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:15,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:15,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash 515198681, now seen corresponding path program 1 times [2024-11-10 00:59:15,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:15,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56710912] [2024-11-10 00:59:15,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:16,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:16,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56710912] [2024-11-10 00:59:16,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56710912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:16,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:16,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:59:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5206748] [2024-11-10 00:59:16,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:16,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:16,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:16,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:16,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:16,206 INFO L87 Difference]: Start difference. First operand has 923 states, 920 states have (on average 2.635869565217391) internal successors, (2425), 922 states have internal predecessors, (2425), 0 states have call successors, (0), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:21,186 INFO L93 Difference]: Finished difference Result 2552 states and 6941 transitions. [2024-11-10 00:59:21,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:21,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-10 00:59:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:21,210 INFO L225 Difference]: With dead ends: 2552 [2024-11-10 00:59:21,211 INFO L226 Difference]: Without dead ends: 1607 [2024-11-10 00:59:21,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:21,221 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1740 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 4568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:21,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 331 Invalid, 4568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-10 00:59:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-10 00:59:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2024-11-10 00:59:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1605 states have (on average 2.6853582554517135) internal successors, (4310), 1606 states have internal predecessors, (4310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 4310 transitions. [2024-11-10 00:59:21,374 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 4310 transitions. Word has length 9 [2024-11-10 00:59:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:21,374 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 4310 transitions. [2024-11-10 00:59:21,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 4310 transitions. [2024-11-10 00:59:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 00:59:21,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:21,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:21,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:59:21,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:21,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1090523693, now seen corresponding path program 1 times [2024-11-10 00:59:21,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:21,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80515482] [2024-11-10 00:59:21,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:21,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:21,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80515482] [2024-11-10 00:59:21,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80515482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:21,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:21,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:59:21,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233315064] [2024-11-10 00:59:21,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:21,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:59:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:59:21,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:59:21,605 INFO L87 Difference]: Start difference. First operand 1607 states and 4310 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:21,824 INFO L93 Difference]: Finished difference Result 1664 states and 4397 transitions. [2024-11-10 00:59:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:59:21,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-10 00:59:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:21,837 INFO L225 Difference]: With dead ends: 1664 [2024-11-10 00:59:21,840 INFO L226 Difference]: Without dead ends: 1607 [2024-11-10 00:59:21,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:59:21,842 INFO L432 NwaCegarLoop]: 2288 mSDtfsCounter, 0 mSDsluCounter, 6819 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9107 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:21,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9107 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-10 00:59:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2024-11-10 00:59:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1605 states have (on average 2.660436137071651) internal successors, (4270), 1606 states have internal predecessors, (4270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 4270 transitions. [2024-11-10 00:59:21,901 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 4270 transitions. Word has length 28 [2024-11-10 00:59:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:21,902 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 4270 transitions. [2024-11-10 00:59:21,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 4270 transitions. [2024-11-10 00:59:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:59:21,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:21,909 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] [2024-11-10 00:59:21,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:59:21,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:21,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash 165928225, now seen corresponding path program 1 times [2024-11-10 00:59:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252794978] [2024-11-10 00:59:21,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:22,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:22,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252794978] [2024-11-10 00:59:22,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252794978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:22,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:22,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:22,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61803191] [2024-11-10 00:59:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:22,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:22,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:22,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:22,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:22,347 INFO L87 Difference]: Start difference. First operand 1607 states and 4270 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:22,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:22,708 INFO L93 Difference]: Finished difference Result 2243 states and 5266 transitions. [2024-11-10 00:59:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:59:22,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-10 00:59:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:22,730 INFO L225 Difference]: With dead ends: 2243 [2024-11-10 00:59:22,731 INFO L226 Difference]: Without dead ends: 2190 [2024-11-10 00:59:22,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:59:22,732 INFO L432 NwaCegarLoop]: 2244 mSDtfsCounter, 13988 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13988 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:22,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13988 Valid, 3830 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2024-11-10 00:59:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1657. [2024-11-10 00:59:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1655 states have (on average 2.6277945619335346) internal successors, (4349), 1656 states have internal predecessors, (4349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 4349 transitions. [2024-11-10 00:59:22,829 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 4349 transitions. Word has length 67 [2024-11-10 00:59:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:22,830 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 4349 transitions. [2024-11-10 00:59:22,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 4349 transitions. [2024-11-10 00:59:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:59:22,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:22,834 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 00:59:22,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:59:22,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:22,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1462372477, now seen corresponding path program 1 times [2024-11-10 00:59:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501743716] [2024-11-10 00:59:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:23,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:23,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501743716] [2024-11-10 00:59:23,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501743716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:23,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:23,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:23,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387072757] [2024-11-10 00:59:23,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:23,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:23,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:23,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:23,190 INFO L87 Difference]: Start difference. First operand 1657 states and 4349 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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 00:59:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:23,426 INFO L93 Difference]: Finished difference Result 1763 states and 4513 transitions. [2024-11-10 00:59:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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 00:59:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:23,433 INFO L225 Difference]: With dead ends: 1763 [2024-11-10 00:59:23,433 INFO L226 Difference]: Without dead ends: 1660 [2024-11-10 00:59:23,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:59:23,435 INFO L432 NwaCegarLoop]: 2242 mSDtfsCounter, 13114 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13114 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:23,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13114 Valid, 2640 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-10 00:59:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1657. [2024-11-10 00:59:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1655 states have (on average 2.627190332326284) internal successors, (4348), 1656 states have internal predecessors, (4348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 4348 transitions. [2024-11-10 00:59:23,472 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 4348 transitions. Word has length 69 [2024-11-10 00:59:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:23,472 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 4348 transitions. [2024-11-10 00:59:23,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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 00:59:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 4348 transitions. [2024-11-10 00:59:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 00:59:23,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:23,474 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] [2024-11-10 00:59:23,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:59:23,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:23,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:23,475 INFO L85 PathProgramCache]: Analyzing trace with hash -660054622, now seen corresponding path program 1 times [2024-11-10 00:59:23,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:23,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648349010] [2024-11-10 00:59:23,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:23,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:23,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648349010] [2024-11-10 00:59:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648349010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:23,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:23,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:23,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837484598] [2024-11-10 00:59:23,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:23,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:23,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:23,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:23,569 INFO L87 Difference]: Start difference. First operand 1657 states and 4348 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:23,613 INFO L93 Difference]: Finished difference Result 1851 states and 4650 transitions. [2024-11-10 00:59:23,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:23,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-10 00:59:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:23,620 INFO L225 Difference]: With dead ends: 1851 [2024-11-10 00:59:23,621 INFO L226 Difference]: Without dead ends: 1748 [2024-11-10 00:59:23,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:23,623 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 2176 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 2322 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 00:59:23,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 2322 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2024-11-10 00:59:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1743. [2024-11-10 00:59:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1741 states have (on average 2.5732337736932798) internal successors, (4480), 1742 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 4480 transitions. [2024-11-10 00:59:23,667 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 4480 transitions. Word has length 70 [2024-11-10 00:59:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:23,667 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 4480 transitions. [2024-11-10 00:59:23,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 4480 transitions. [2024-11-10 00:59:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:23,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:23,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] [2024-11-10 00:59:23,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:59:23,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:23,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:23,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1454056645, now seen corresponding path program 1 times [2024-11-10 00:59:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:23,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876348091] [2024-11-10 00:59:23,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:23,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:23,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876348091] [2024-11-10 00:59:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876348091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:23,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:23,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:23,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215464955] [2024-11-10 00:59:23,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:23,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:23,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:23,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:23,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:23,771 INFO L87 Difference]: Start difference. First operand 1743 states and 4480 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:23,812 INFO L93 Difference]: Finished difference Result 2105 states and 5038 transitions. [2024-11-10 00:59:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:23,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:59:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:23,820 INFO L225 Difference]: With dead ends: 2105 [2024-11-10 00:59:23,820 INFO L226 Difference]: Without dead ends: 1916 [2024-11-10 00:59:23,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:23,822 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 2189 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:23,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2189 Valid, 2391 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-11-10 00:59:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1913. [2024-11-10 00:59:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1911 states have (on average 2.47985347985348) internal successors, (4739), 1912 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 4739 transitions. [2024-11-10 00:59:23,870 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 4739 transitions. Word has length 71 [2024-11-10 00:59:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:23,870 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 4739 transitions. [2024-11-10 00:59:23,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 4739 transitions. [2024-11-10 00:59:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:23,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:23,872 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] [2024-11-10 00:59:23,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:59:23,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:23,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash 452646917, now seen corresponding path program 1 times [2024-11-10 00:59:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:23,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772209200] [2024-11-10 00:59:23,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:23,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:23,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:23,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772209200] [2024-11-10 00:59:23,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772209200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:23,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:23,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616500919] [2024-11-10 00:59:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:23,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:23,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:23,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:23,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:23,944 INFO L87 Difference]: Start difference. First operand 1913 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:23,982 INFO L93 Difference]: Finished difference Result 2599 states and 5787 transitions. [2024-11-10 00:59:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:23,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:59:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:23,990 INFO L225 Difference]: With dead ends: 2599 [2024-11-10 00:59:23,990 INFO L226 Difference]: Without dead ends: 2240 [2024-11-10 00:59:23,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:23,993 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 2187 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:23,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 2393 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-11-10 00:59:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2237. [2024-11-10 00:59:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2235 states have (on average 2.3378076062639823) internal successors, (5225), 2236 states have internal predecessors, (5225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 5225 transitions. [2024-11-10 00:59:24,044 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 5225 transitions. Word has length 71 [2024-11-10 00:59:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:24,045 INFO L471 AbstractCegarLoop]: Abstraction has 2237 states and 5225 transitions. [2024-11-10 00:59:24,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 5225 transitions. [2024-11-10 00:59:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:24,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:24,046 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] [2024-11-10 00:59:24,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:59:24,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:24,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:24,046 INFO L85 PathProgramCache]: Analyzing trace with hash 438197061, now seen corresponding path program 1 times [2024-11-10 00:59:24,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:24,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362053647] [2024-11-10 00:59:24,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:24,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:24,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362053647] [2024-11-10 00:59:24,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362053647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:24,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:24,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:24,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988618099] [2024-11-10 00:59:24,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:24,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:24,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:24,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:24,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:24,114 INFO L87 Difference]: Start difference. First operand 2237 states and 5225 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:24,161 INFO L93 Difference]: Finished difference Result 3539 states and 7189 transitions. [2024-11-10 00:59:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:59:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:24,171 INFO L225 Difference]: With dead ends: 3539 [2024-11-10 00:59:24,171 INFO L226 Difference]: Without dead ends: 2856 [2024-11-10 00:59:24,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:24,173 INFO L432 NwaCegarLoop]: 2295 mSDtfsCounter, 2185 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:24,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 2395 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:24,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2024-11-10 00:59:24,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2853. [2024-11-10 00:59:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2851 states have (on average 2.151175026306559) internal successors, (6133), 2852 states have internal predecessors, (6133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 6133 transitions. [2024-11-10 00:59:24,240 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 6133 transitions. Word has length 71 [2024-11-10 00:59:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:24,240 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 6133 transitions. [2024-11-10 00:59:24,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 6133 transitions. [2024-11-10 00:59:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:24,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:24,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] [2024-11-10 00:59:24,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:59:24,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:24,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:24,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1765167483, now seen corresponding path program 1 times [2024-11-10 00:59:24,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:24,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563817396] [2024-11-10 00:59:24,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:24,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:24,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563817396] [2024-11-10 00:59:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563817396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:24,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073392774] [2024-11-10 00:59:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:24,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:24,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:24,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:24,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:24,314 INFO L87 Difference]: Start difference. First operand 2853 states and 6133 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:24,458 INFO L93 Difference]: Finished difference Result 5323 states and 9801 transitions. [2024-11-10 00:59:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:24,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:59:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:24,477 INFO L225 Difference]: With dead ends: 5323 [2024-11-10 00:59:24,477 INFO L226 Difference]: Without dead ends: 4024 [2024-11-10 00:59:24,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:24,483 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 2183 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2183 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:24,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2183 Valid, 2397 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2024-11-10 00:59:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 4021. [2024-11-10 00:59:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4021 states, 4019 states have (on average 1.9460064692709629) internal successors, (7821), 4020 states have internal predecessors, (7821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 7821 transitions. [2024-11-10 00:59:24,560 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 7821 transitions. Word has length 71 [2024-11-10 00:59:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:24,560 INFO L471 AbstractCegarLoop]: Abstraction has 4021 states and 7821 transitions. [2024-11-10 00:59:24,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 7821 transitions. [2024-11-10 00:59:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:24,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:24,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:24,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:59:24,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:24,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2005522758, now seen corresponding path program 1 times [2024-11-10 00:59:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:24,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85054176] [2024-11-10 00:59:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:24,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:24,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85054176] [2024-11-10 00:59:24,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85054176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:24,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:24,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:24,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735499120] [2024-11-10 00:59:24,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:24,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:24,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:24,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:24,763 INFO L87 Difference]: Start difference. First operand 4021 states and 7821 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:24,863 INFO L93 Difference]: Finished difference Result 4120 states and 7951 transitions. [2024-11-10 00:59:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:59:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:24,876 INFO L225 Difference]: With dead ends: 4120 [2024-11-10 00:59:24,876 INFO L226 Difference]: Without dead ends: 4117 [2024-11-10 00:59:24,877 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 00:59:24,878 INFO L432 NwaCegarLoop]: 2244 mSDtfsCounter, 0 mSDsluCounter, 13451 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15695 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 00:59:24,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15695 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2024-11-10 00:59:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 4117. [2024-11-10 00:59:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4117 states, 4115 states have (on average 1.920048602673147) internal successors, (7901), 4116 states have internal predecessors, (7901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 7901 transitions. [2024-11-10 00:59:24,960 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 7901 transitions. Word has length 71 [2024-11-10 00:59:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:24,961 INFO L471 AbstractCegarLoop]: Abstraction has 4117 states and 7901 transitions. [2024-11-10 00:59:24,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 7901 transitions. [2024-11-10 00:59:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:24,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:24,962 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] [2024-11-10 00:59:24,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:59:24,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:24,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1736130949, now seen corresponding path program 1 times [2024-11-10 00:59:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140017482] [2024-11-10 00:59:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:25,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140017482] [2024-11-10 00:59:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140017482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:25,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862329597] [2024-11-10 00:59:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:25,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:25,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:25,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:25,010 INFO L87 Difference]: Start difference. First operand 4117 states and 7901 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:25,074 INFO L93 Difference]: Finished difference Result 8987 states and 14881 transitions. [2024-11-10 00:59:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:25,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:59:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:25,085 INFO L225 Difference]: With dead ends: 8987 [2024-11-10 00:59:25,086 INFO L226 Difference]: Without dead ends: 6424 [2024-11-10 00:59:25,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:25,091 INFO L432 NwaCegarLoop]: 2309 mSDtfsCounter, 2191 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:25,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 2397 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6424 states. [2024-11-10 00:59:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6424 to 6421. [2024-11-10 00:59:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6421 states, 6419 states have (on average 1.7293971023523913) internal successors, (11101), 6420 states have internal predecessors, (11101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 11101 transitions. [2024-11-10 00:59:25,223 INFO L78 Accepts]: Start accepts. Automaton has 6421 states and 11101 transitions. Word has length 71 [2024-11-10 00:59:25,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:25,223 INFO L471 AbstractCegarLoop]: Abstraction has 6421 states and 11101 transitions. [2024-11-10 00:59:25,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:25,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6421 states and 11101 transitions. [2024-11-10 00:59:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:59:25,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:25,225 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] [2024-11-10 00:59:25,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:59:25,225 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:25,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:25,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1729014533, now seen corresponding path program 1 times [2024-11-10 00:59:25,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:25,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377495326] [2024-11-10 00:59:25,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:25,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:25,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377495326] [2024-11-10 00:59:25,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377495326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:25,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:25,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:25,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653234653] [2024-11-10 00:59:25,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:25,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:25,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:25,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:25,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:25,277 INFO L87 Difference]: Start difference. First operand 6421 states and 11101 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:25,370 INFO L93 Difference]: Finished difference Result 11551 states and 18470 transitions. [2024-11-10 00:59:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:25,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-11-10 00:59:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:25,386 INFO L225 Difference]: With dead ends: 11551 [2024-11-10 00:59:25,386 INFO L226 Difference]: Without dead ends: 8795 [2024-11-10 00:59:25,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:25,393 INFO L432 NwaCegarLoop]: 2314 mSDtfsCounter, 2190 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:25,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2398 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8795 states. [2024-11-10 00:59:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8795 to 8792. [2024-11-10 00:59:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8792 states, 8790 states have (on average 1.6382252559726962) internal successors, (14400), 8791 states have internal predecessors, (14400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8792 states to 8792 states and 14400 transitions. [2024-11-10 00:59:25,569 INFO L78 Accepts]: Start accepts. Automaton has 8792 states and 14400 transitions. Word has length 73 [2024-11-10 00:59:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:25,569 INFO L471 AbstractCegarLoop]: Abstraction has 8792 states and 14400 transitions. [2024-11-10 00:59:25,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8792 states and 14400 transitions. [2024-11-10 00:59:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:59:25,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:25,571 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:59:25,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:59:25,571 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:25,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2012926435, now seen corresponding path program 1 times [2024-11-10 00:59:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:25,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409098031] [2024-11-10 00:59:25,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:25,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409098031] [2024-11-10 00:59:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409098031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:25,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:25,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961381652] [2024-11-10 00:59:25,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:25,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:59:25,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:25,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:59:25,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:59:25,832 INFO L87 Difference]: Start difference. First operand 8792 states and 14400 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:33,731 INFO L93 Difference]: Finished difference Result 12555 states and 24696 transitions. [2024-11-10 00:59:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:59:33,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-10 00:59:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:33,760 INFO L225 Difference]: With dead ends: 12555 [2024-11-10 00:59:33,761 INFO L226 Difference]: Without dead ends: 11048 [2024-11-10 00:59:33,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:59:33,768 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 4475 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4475 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 9022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:33,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4475 Valid, 847 Invalid, 9022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-10 00:59:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11048 states. [2024-11-10 00:59:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11048 to 11048. [2024-11-10 00:59:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11048 states, 11046 states have (on average 1.7718631178707225) internal successors, (19572), 11047 states have internal predecessors, (19572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 19572 transitions. [2024-11-10 00:59:33,980 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 19572 transitions. Word has length 79 [2024-11-10 00:59:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:33,980 INFO L471 AbstractCegarLoop]: Abstraction has 11048 states and 19572 transitions. [2024-11-10 00:59:33,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 19572 transitions. [2024-11-10 00:59:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:59:33,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:33,981 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-10 00:59:33,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:59:33,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:33,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:33,982 INFO L85 PathProgramCache]: Analyzing trace with hash 453856919, now seen corresponding path program 1 times [2024-11-10 00:59:33,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:33,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851805590] [2024-11-10 00:59:33,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:33,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:34,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:34,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851805590] [2024-11-10 00:59:34,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851805590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:34,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:34,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:34,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658020312] [2024-11-10 00:59:34,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:34,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:34,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:34,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:34,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:34,032 INFO L87 Difference]: Start difference. First operand 11048 states and 19572 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:38,257 INFO L93 Difference]: Finished difference Result 17819 states and 36754 transitions. [2024-11-10 00:59:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:38,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:59:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:38,282 INFO L225 Difference]: With dead ends: 17819 [2024-11-10 00:59:38,283 INFO L226 Difference]: Without dead ends: 14056 [2024-11-10 00:59:38,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:38,290 INFO L432 NwaCegarLoop]: 1782 mSDtfsCounter, 1464 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 3679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:38,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1921 Invalid, 4425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 3679 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-10 00:59:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14056 states. [2024-11-10 00:59:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14056 to 14056. [2024-11-10 00:59:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14056 states, 14054 states have (on average 1.9052227123950476) internal successors, (26776), 14055 states have internal predecessors, (26776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14056 states to 14056 states and 26776 transitions. [2024-11-10 00:59:38,628 INFO L78 Accepts]: Start accepts. Automaton has 14056 states and 26776 transitions. Word has length 81 [2024-11-10 00:59:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:38,628 INFO L471 AbstractCegarLoop]: Abstraction has 14056 states and 26776 transitions. [2024-11-10 00:59:38,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 14056 states and 26776 transitions. [2024-11-10 00:59:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:38,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:38,633 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:59:38,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:59:38,633 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:38,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:38,634 INFO L85 PathProgramCache]: Analyzing trace with hash 8683955, now seen corresponding path program 1 times [2024-11-10 00:59:38,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:38,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213611253] [2024-11-10 00:59:38,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:59:38,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:38,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213611253] [2024-11-10 00:59:38,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213611253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:38,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:38,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903164219] [2024-11-10 00:59:38,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:38,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:38,829 INFO L87 Difference]: Start difference. First operand 14056 states and 26776 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:39,701 INFO L93 Difference]: Finished difference Result 59005 states and 90118 transitions. [2024-11-10 00:59:39,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:39,701 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:59:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:39,783 INFO L225 Difference]: With dead ends: 59005 [2024-11-10 00:59:39,784 INFO L226 Difference]: Without dead ends: 51770 [2024-11-10 00:59:39,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:39,813 INFO L432 NwaCegarLoop]: 2332 mSDtfsCounter, 11547 mSDsluCounter, 2935 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11547 SdHoareTripleChecker+Valid, 5267 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:39,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11547 Valid, 5267 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51770 states. [2024-11-10 00:59:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51770 to 21288. [2024-11-10 00:59:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21288 states, 21286 states have (on average 1.7329700272479565) internal successors, (36888), 21287 states have internal predecessors, (36888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21288 states to 21288 states and 36888 transitions. [2024-11-10 00:59:40,520 INFO L78 Accepts]: Start accepts. Automaton has 21288 states and 36888 transitions. Word has length 94 [2024-11-10 00:59:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:40,520 INFO L471 AbstractCegarLoop]: Abstraction has 21288 states and 36888 transitions. [2024-11-10 00:59:40,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21288 states and 36888 transitions. [2024-11-10 00:59:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:40,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:40,524 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:59:40,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:59:40,525 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:40,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash -992725773, now seen corresponding path program 1 times [2024-11-10 00:59:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:40,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906273220] [2024-11-10 00:59:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:40,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:59:40,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:40,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906273220] [2024-11-10 00:59:40,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906273220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:40,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:40,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902459589] [2024-11-10 00:59:40,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:40,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:40,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:40,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:40,726 INFO L87 Difference]: Start difference. First operand 21288 states and 36888 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:41,583 INFO L93 Difference]: Finished difference Result 66237 states and 100230 transitions. [2024-11-10 00:59:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:59:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:41,674 INFO L225 Difference]: With dead ends: 66237 [2024-11-10 00:59:41,674 INFO L226 Difference]: Without dead ends: 59002 [2024-11-10 00:59:41,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:41,696 INFO L432 NwaCegarLoop]: 2328 mSDtfsCounter, 11598 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11598 SdHoareTripleChecker+Valid, 5189 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:41,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11598 Valid, 5189 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59002 states. [2024-11-10 00:59:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59002 to 32168. [2024-11-10 00:59:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32168 states, 32166 states have (on average 1.61636510601256) internal successors, (51992), 32167 states have internal predecessors, (51992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32168 states to 32168 states and 51992 transitions. [2024-11-10 00:59:42,573 INFO L78 Accepts]: Start accepts. Automaton has 32168 states and 51992 transitions. Word has length 94 [2024-11-10 00:59:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:42,574 INFO L471 AbstractCegarLoop]: Abstraction has 32168 states and 51992 transitions. [2024-11-10 00:59:42,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 32168 states and 51992 transitions. [2024-11-10 00:59:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:42,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:42,582 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:59:42,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:59:42,582 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:42,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1007175629, now seen corresponding path program 1 times [2024-11-10 00:59:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:42,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741053991] [2024-11-10 00:59:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:59:42,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:42,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741053991] [2024-11-10 00:59:42,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741053991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:42,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:42,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528339482] [2024-11-10 00:59:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:42,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:42,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:42,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:42,933 INFO L87 Difference]: Start difference. First operand 32168 states and 51992 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:43,937 INFO L93 Difference]: Finished difference Result 73469 states and 110342 transitions. [2024-11-10 00:59:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:43,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:59:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:44,076 INFO L225 Difference]: With dead ends: 73469 [2024-11-10 00:59:44,076 INFO L226 Difference]: Without dead ends: 66234 [2024-11-10 00:59:44,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:44,128 INFO L432 NwaCegarLoop]: 2324 mSDtfsCounter, 11650 mSDsluCounter, 2870 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11650 SdHoareTripleChecker+Valid, 5194 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:44,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11650 Valid, 5194 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66234 states. [2024-11-10 00:59:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66234 to 39400. [2024-11-10 00:59:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39400 states, 39398 states have (on average 1.5763236712523478) internal successors, (62104), 39399 states have internal predecessors, (62104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39400 states to 39400 states and 62104 transitions. [2024-11-10 00:59:45,396 INFO L78 Accepts]: Start accepts. Automaton has 39400 states and 62104 transitions. Word has length 94 [2024-11-10 00:59:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:45,396 INFO L471 AbstractCegarLoop]: Abstraction has 39400 states and 62104 transitions. [2024-11-10 00:59:45,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 39400 states and 62104 transitions. [2024-11-10 00:59:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:45,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:45,403 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:59:45,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:59:45,407 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:45,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:45,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1084427123, now seen corresponding path program 1 times [2024-11-10 00:59:45,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:45,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469724965] [2024-11-10 00:59:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:45,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 00:59:45,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:45,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469724965] [2024-11-10 00:59:45,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469724965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:45,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:45,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:45,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465463276] [2024-11-10 00:59:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:45,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:45,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:45,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:45,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:45,635 INFO L87 Difference]: Start difference. First operand 39400 states and 62104 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:46,968 INFO L93 Difference]: Finished difference Result 80701 states and 120454 transitions. [2024-11-10 00:59:46,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:46,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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 94 [2024-11-10 00:59:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:47,096 INFO L225 Difference]: With dead ends: 80701 [2024-11-10 00:59:47,096 INFO L226 Difference]: Without dead ends: 73466 [2024-11-10 00:59:47,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:47,122 INFO L432 NwaCegarLoop]: 2333 mSDtfsCounter, 11547 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11547 SdHoareTripleChecker+Valid, 5295 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:47,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11547 Valid, 5295 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73466 states. [2024-11-10 00:59:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73466 to 46632. [2024-11-10 00:59:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46632 states, 46630 states have (on average 1.548702552005147) internal successors, (72216), 46631 states have internal predecessors, (72216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46632 states to 46632 states and 72216 transitions. [2024-11-10 00:59:48,237 INFO L78 Accepts]: Start accepts. Automaton has 46632 states and 72216 transitions. Word has length 94 [2024-11-10 00:59:48,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:48,239 INFO L471 AbstractCegarLoop]: Abstraction has 46632 states and 72216 transitions. [2024-11-10 00:59:48,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 46632 states and 72216 transitions. [2024-11-10 00:59:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:48,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:48,248 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:59:48,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:59:48,249 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:48,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:48,249 INFO L85 PathProgramCache]: Analyzing trace with hash 290758259, now seen corresponding path program 1 times [2024-11-10 00:59:48,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:48,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927682755] [2024-11-10 00:59:48,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:48,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:59:48,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:48,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927682755] [2024-11-10 00:59:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927682755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:48,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:48,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928299312] [2024-11-10 00:59:48,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:48,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:48,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:48,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:48,405 INFO L87 Difference]: Start difference. First operand 46632 states and 72216 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:49,742 INFO L93 Difference]: Finished difference Result 87933 states and 130566 transitions. [2024-11-10 00:59:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:49,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:59:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:49,839 INFO L225 Difference]: With dead ends: 87933 [2024-11-10 00:59:49,839 INFO L226 Difference]: Without dead ends: 80698 [2024-11-10 00:59:49,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:49,859 INFO L432 NwaCegarLoop]: 2333 mSDtfsCounter, 11483 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11483 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:49,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11483 Valid, 5450 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80698 states. [2024-11-10 00:59:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80698 to 53864. [2024-11-10 00:59:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53864 states, 53862 states have (on average 1.5284987560803536) internal successors, (82328), 53863 states have internal predecessors, (82328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53864 states to 53864 states and 82328 transitions. [2024-11-10 00:59:51,822 INFO L78 Accepts]: Start accepts. Automaton has 53864 states and 82328 transitions. Word has length 94 [2024-11-10 00:59:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:51,822 INFO L471 AbstractCegarLoop]: Abstraction has 53864 states and 82328 transitions. [2024-11-10 00:59:51,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 53864 states and 82328 transitions. [2024-11-10 00:59:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:59:51,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:51,827 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] [2024-11-10 00:59:51,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:59:51,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:51,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2044706709, now seen corresponding path program 1 times [2024-11-10 00:59:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289071041] [2024-11-10 00:59:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:51,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289071041] [2024-11-10 00:59:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289071041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:51,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:51,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:51,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225126582] [2024-11-10 00:59:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:51,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:51,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:51,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:51,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:51,954 INFO L87 Difference]: Start difference. First operand 53864 states and 82328 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 00:59:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:52,605 INFO L93 Difference]: Finished difference Result 87174 states and 129365 transitions. [2024-11-10 00:59:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:52,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-10 00:59:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:52,678 INFO L225 Difference]: With dead ends: 87174 [2024-11-10 00:59:52,678 INFO L226 Difference]: Without dead ends: 40131 [2024-11-10 00:59:52,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:52,716 INFO L432 NwaCegarLoop]: 2300 mSDtfsCounter, 59 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4535 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:52,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4535 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40131 states. [2024-11-10 00:59:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40131 to 40128. [2024-11-10 00:59:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40128 states, 40126 states have (on average 1.5746398843642526) internal successors, (63184), 40127 states have internal predecessors, (63184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40128 states to 40128 states and 63184 transitions. [2024-11-10 00:59:53,731 INFO L78 Accepts]: Start accepts. Automaton has 40128 states and 63184 transitions. Word has length 96 [2024-11-10 00:59:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:53,732 INFO L471 AbstractCegarLoop]: Abstraction has 40128 states and 63184 transitions. [2024-11-10 00:59:53,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 00:59:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 40128 states and 63184 transitions. [2024-11-10 00:59:53,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:59:53,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:53,736 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:59:53,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:59:53,736 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:53,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash 296051, now seen corresponding path program 1 times [2024-11-10 00:59:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485603221] [2024-11-10 00:59:53,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:53,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:59:53,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:53,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485603221] [2024-11-10 00:59:53,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485603221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:53,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:53,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:53,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861950632] [2024-11-10 00:59:53,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:53,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:53,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:53,860 INFO L87 Difference]: Start difference. First operand 40128 states and 63184 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 00:59:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:55,180 INFO L93 Difference]: Finished difference Result 70869 states and 106590 transitions. [2024-11-10 00:59:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:55,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 96 [2024-11-10 00:59:55,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:55,262 INFO L225 Difference]: With dead ends: 70869 [2024-11-10 00:59:55,262 INFO L226 Difference]: Without dead ends: 65746 [2024-11-10 00:59:55,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:55,284 INFO L432 NwaCegarLoop]: 2321 mSDtfsCounter, 11508 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11508 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:55,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11508 Valid, 5390 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65746 states. [2024-11-10 00:59:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65746 to 45248. [2024-11-10 00:59:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45248 states, 45246 states have (on average 1.5548777792512045) internal successors, (70352), 45247 states have internal predecessors, (70352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45248 states to 45248 states and 70352 transitions. [2024-11-10 00:59:56,947 INFO L78 Accepts]: Start accepts. Automaton has 45248 states and 70352 transitions. Word has length 96 [2024-11-10 00:59:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:56,947 INFO L471 AbstractCegarLoop]: Abstraction has 45248 states and 70352 transitions. [2024-11-10 00:59:56,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 00:59:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 45248 states and 70352 transitions. [2024-11-10 00:59:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:59:56,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:56,962 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] [2024-11-10 00:59:56,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:59:56,962 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:56,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:56,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1721101739, now seen corresponding path program 1 times [2024-11-10 00:59:56,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:56,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898053996] [2024-11-10 00:59:56,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:56,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:57,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:57,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898053996] [2024-11-10 00:59:57,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898053996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:57,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:57,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:57,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643551983] [2024-11-10 00:59:57,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:57,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:57,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:57,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:57,230 INFO L87 Difference]: Start difference. First operand 45248 states and 70352 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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 00:59:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:57,759 INFO L93 Difference]: Finished difference Result 64454 states and 97236 transitions. [2024-11-10 00:59:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:57,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-10 00:59:57,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:57,801 INFO L225 Difference]: With dead ends: 64454 [2024-11-10 00:59:57,801 INFO L226 Difference]: Without dead ends: 26051 [2024-11-10 00:59:57,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:57,818 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 52 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4520 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:57,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4520 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26051 states. [2024-11-10 00:59:58,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26051 to 26048. [2024-11-10 00:59:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26048 states, 26046 states have (on average 1.6598326038547186) internal successors, (43232), 26047 states have internal predecessors, (43232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26048 states to 26048 states and 43232 transitions. [2024-11-10 00:59:58,624 INFO L78 Accepts]: Start accepts. Automaton has 26048 states and 43232 transitions. Word has length 98 [2024-11-10 00:59:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:58,624 INFO L471 AbstractCegarLoop]: Abstraction has 26048 states and 43232 transitions. [2024-11-10 00:59:58,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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 00:59:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 26048 states and 43232 transitions. [2024-11-10 00:59:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:59:58,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:58,627 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:59:58,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:59:58,627 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:58,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2089553961, now seen corresponding path program 1 times [2024-11-10 00:59:58,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:58,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116941719] [2024-11-10 00:59:58,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:58,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:58,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:58,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116941719] [2024-11-10 00:59:58,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116941719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:58,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:58,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737350421] [2024-11-10 00:59:58,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:58,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:58,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:58,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:58,703 INFO L87 Difference]: Start difference. First operand 26048 states and 43232 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 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 00:59:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:58,908 INFO L93 Difference]: Finished difference Result 35654 states and 56556 transitions. [2024-11-10 00:59:58,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:58,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 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 100 [2024-11-10 00:59:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:58,930 INFO L225 Difference]: With dead ends: 35654 [2024-11-10 00:59:58,930 INFO L226 Difference]: Without dead ends: 16451 [2024-11-10 00:59:58,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:58,953 INFO L432 NwaCegarLoop]: 2286 mSDtfsCounter, 47 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4505 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:58,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4505 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16451 states. [2024-11-10 00:59:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16451 to 16448. [2024-11-10 00:59:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16448 states, 16446 states have (on average 1.8115043171591876) internal successors, (29792), 16447 states have internal predecessors, (29792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16448 states to 16448 states and 29792 transitions. [2024-11-10 00:59:59,526 INFO L78 Accepts]: Start accepts. Automaton has 16448 states and 29792 transitions. Word has length 100 [2024-11-10 00:59:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:59,526 INFO L471 AbstractCegarLoop]: Abstraction has 16448 states and 29792 transitions. [2024-11-10 00:59:59,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 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 00:59:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 16448 states and 29792 transitions. [2024-11-10 00:59:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 00:59:59,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:59,528 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-11-10 00:59:59,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:59:59,528 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:59,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:59,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2047755810, now seen corresponding path program 1 times [2024-11-10 00:59:59,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:59,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625555083] [2024-11-10 00:59:59,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:59,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625555083] [2024-11-10 00:59:59,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625555083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:59,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:59,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:59,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664809031] [2024-11-10 00:59:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:59,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:59,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:59,629 INFO L87 Difference]: Start difference. First operand 16448 states and 29792 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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) [2024-11-10 00:59:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:59,956 INFO L93 Difference]: Finished difference Result 21254 states and 36396 transitions. [2024-11-10 00:59:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:59,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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) Word has length 102 [2024-11-10 00:59:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:59,971 INFO L225 Difference]: With dead ends: 21254 [2024-11-10 00:59:59,971 INFO L226 Difference]: Without dead ends: 11651 [2024-11-10 00:59:59,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:59,974 INFO L432 NwaCegarLoop]: 2279 mSDtfsCounter, 44 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4490 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:59,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4490 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11651 states. [2024-11-10 01:00:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11651 to 11648. [2024-11-10 01:00:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11648 states, 11646 states have (on average 1.986261377296926) internal successors, (23132), 11647 states have internal predecessors, (23132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11648 states to 11648 states and 23132 transitions. [2024-11-10 01:00:00,141 INFO L78 Accepts]: Start accepts. Automaton has 11648 states and 23132 transitions. Word has length 102 [2024-11-10 01:00:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:00,141 INFO L471 AbstractCegarLoop]: Abstraction has 11648 states and 23132 transitions. [2024-11-10 01:00:00,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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) [2024-11-10 01:00:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 11648 states and 23132 transitions. [2024-11-10 01:00:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 01:00:00,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:00,143 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:00,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 01:00:00,143 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:00,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1649296645, now seen corresponding path program 1 times [2024-11-10 01:00:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:00,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67346946] [2024-11-10 01:00:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:00,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:00,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:00,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67346946] [2024-11-10 01:00:00,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67346946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:00,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:00,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:00,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002530939] [2024-11-10 01:00:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:00,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:00,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:00,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:00,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:00,227 INFO L87 Difference]: Start difference. First operand 11648 states and 23132 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:00,310 INFO L93 Difference]: Finished difference Result 14054 states and 26406 transitions. [2024-11-10 01:00:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:00,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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 104 [2024-11-10 01:00:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:00,326 INFO L225 Difference]: With dead ends: 14054 [2024-11-10 01:00:00,326 INFO L226 Difference]: Without dead ends: 9251 [2024-11-10 01:00:00,332 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:00,334 INFO L432 NwaCegarLoop]: 2272 mSDtfsCounter, 41 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4475 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:00,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4475 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:00:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9251 states. [2024-11-10 01:00:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9251 to 9248. [2024-11-10 01:00:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9248 states, 9246 states have (on average 2.1449275362318843) internal successors, (19832), 9247 states have internal predecessors, (19832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 19832 transitions. [2024-11-10 01:00:00,624 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 19832 transitions. Word has length 104 [2024-11-10 01:00:00,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:00,624 INFO L471 AbstractCegarLoop]: Abstraction has 9248 states and 19832 transitions. [2024-11-10 01:00:00,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 19832 transitions. [2024-11-10 01:00:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 01:00:00,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:00,627 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:00,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 01:00:00,627 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:00,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2017853108, now seen corresponding path program 1 times [2024-11-10 01:00:00,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:00,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761766121] [2024-11-10 01:00:00,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:00,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:00,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761766121] [2024-11-10 01:00:00,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761766121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:00:00,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:00:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:00:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813756955] [2024-11-10 01:00:00,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:00:00,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:00:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:00:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:00:00,764 INFO L87 Difference]: Start difference. First operand 9248 states and 19832 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:00,848 INFO L93 Difference]: Finished difference Result 10454 states and 21456 transitions. [2024-11-10 01:00:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:00:00,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-11-10 01:00:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:00,861 INFO L225 Difference]: With dead ends: 10454 [2024-11-10 01:00:00,862 INFO L226 Difference]: Without dead ends: 8051 [2024-11-10 01:00:00,865 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:00,866 INFO L432 NwaCegarLoop]: 2265 mSDtfsCounter, 38 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4460 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:00,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4460 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:00:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8051 states. [2024-11-10 01:00:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8051 to 8048. [2024-11-10 01:00:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8048 states, 8046 states have (on average 2.2616206810837682) internal successors, (18197), 8047 states have internal predecessors, (18197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8048 states to 8048 states and 18197 transitions. [2024-11-10 01:00:01,018 INFO L78 Accepts]: Start accepts. Automaton has 8048 states and 18197 transitions. Word has length 106 [2024-11-10 01:00:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:01,019 INFO L471 AbstractCegarLoop]: Abstraction has 8048 states and 18197 transitions. [2024-11-10 01:00:01,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 8048 states and 18197 transitions. [2024-11-10 01:00:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:00:01,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:01,020 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:01,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 01:00:01,021 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:01,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:01,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1799921997, now seen corresponding path program 1 times [2024-11-10 01:00:01,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:01,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534101071] [2024-11-10 01:00:01,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:01,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:01,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:01,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534101071] [2024-11-10 01:00:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534101071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:00:01,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498595889] [2024-11-10 01:00:01,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:01,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:00:01,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:00:01,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:00:01,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 01:00:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:01,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 01:00:01,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:00:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:02,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:00:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:03,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498595889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:00:03,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 01:00:03,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-10 01:00:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214554288] [2024-11-10 01:00:03,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 01:00:03,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 01:00:03,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:03,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 01:00:03,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-11-10 01:00:03,245 INFO L87 Difference]: Start difference. First operand 8048 states and 18197 transitions. Second operand has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 25 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:04,628 INFO L93 Difference]: Finished difference Result 13169 states and 25051 transitions. [2024-11-10 01:00:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 01:00:04,629 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 25 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:00:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:04,642 INFO L225 Difference]: With dead ends: 13169 [2024-11-10 01:00:04,642 INFO L226 Difference]: Without dead ends: 11966 [2024-11-10 01:00:04,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=653, Invalid=2539, Unknown=0, NotChecked=0, Total=3192 [2024-11-10 01:00:04,646 INFO L432 NwaCegarLoop]: 2200 mSDtfsCounter, 27499 mSDsluCounter, 9351 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27499 SdHoareTripleChecker+Valid, 11551 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:04,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27499 Valid, 11551 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:00:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11966 states. [2024-11-10 01:00:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11966 to 11888. [2024-11-10 01:00:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11888 states, 11886 states have (on average 1.951203096079421) internal successors, (23192), 11887 states have internal predecessors, (23192), 0 states have call successors, (0), 0 states have 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:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11888 states to 11888 states and 23192 transitions. [2024-11-10 01:00:04,827 INFO L78 Accepts]: Start accepts. Automaton has 11888 states and 23192 transitions. Word has length 108 [2024-11-10 01:00:04,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:04,834 INFO L471 AbstractCegarLoop]: Abstraction has 11888 states and 23192 transitions. [2024-11-10 01:00:04,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 25 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 11888 states and 23192 transitions. [2024-11-10 01:00:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:00:04,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:04,837 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:04,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 01:00:05,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 01:00:05,038 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:05,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:05,038 INFO L85 PathProgramCache]: Analyzing trace with hash 968129491, now seen corresponding path program 1 times [2024-11-10 01:00:05,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:05,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265341050] [2024-11-10 01:00:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:05,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265341050] [2024-11-10 01:00:05,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265341050] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:00:05,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737216341] [2024-11-10 01:00:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:05,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:00:05,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:00:05,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:00:05,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 01:00:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:05,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 01:00:05,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:00:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:06,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:00:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:07,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737216341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:00:07,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 01:00:07,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 01:00:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760746556] [2024-11-10 01:00:07,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 01:00:07,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 01:00:07,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:07,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 01:00:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-11-10 01:00:07,604 INFO L87 Difference]: Start difference. First operand 11888 states and 23192 transitions. Second operand has 25 states, 25 states have (on average 11.76) internal successors, (294), 24 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:09,370 INFO L93 Difference]: Finished difference Result 32789 states and 50686 transitions. [2024-11-10 01:00:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 01:00:09,370 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.76) internal successors, (294), 24 states have internal predecessors, (294), 0 states have call successors, (0), 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:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:09,401 INFO L225 Difference]: With dead ends: 32789 [2024-11-10 01:00:09,402 INFO L226 Difference]: Without dead ends: 27746 [2024-11-10 01:00:09,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=574, Invalid=2288, Unknown=0, NotChecked=0, Total=2862 [2024-11-10 01:00:09,413 INFO L432 NwaCegarLoop]: 2232 mSDtfsCounter, 27352 mSDsluCounter, 12031 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27352 SdHoareTripleChecker+Valid, 14263 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:09,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27352 Valid, 14263 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:00:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27746 states. [2024-11-10 01:00:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27746 to 27488. [2024-11-10 01:00:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27488 states, 27486 states have (on average 1.5728734628538166) internal successors, (43232), 27487 states have internal predecessors, (43232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27488 states to 27488 states and 43232 transitions. [2024-11-10 01:00:10,101 INFO L78 Accepts]: Start accepts. Automaton has 27488 states and 43232 transitions. Word has length 108 [2024-11-10 01:00:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:10,101 INFO L471 AbstractCegarLoop]: Abstraction has 27488 states and 43232 transitions. [2024-11-10 01:00:10,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.76) internal successors, (294), 24 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 27488 states and 43232 transitions. [2024-11-10 01:00:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 01:00:10,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:10,104 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:10,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 01:00:10,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-10 01:00:10,308 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:10,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1565961508, now seen corresponding path program 1 times [2024-11-10 01:00:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:10,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027064464] [2024-11-10 01:00:10,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:10,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:10,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027064464] [2024-11-10 01:00:10,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027064464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:00:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603115739] [2024-11-10 01:00:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:10,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:00:10,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:00:10,782 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:00:10,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 01:00:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:10,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 01:00:10,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:00:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:11,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:00:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:11,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603115739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:00:11,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 01:00:11,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-10 01:00:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389504251] [2024-11-10 01:00:11,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 01:00:11,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 01:00:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 01:00:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-11-10 01:00:11,961 INFO L87 Difference]: Start difference. First operand 27488 states and 43232 transitions. Second operand has 21 states, 21 states have (on average 11.238095238095237) internal successors, (236), 20 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:13,322 INFO L93 Difference]: Finished difference Result 70217 states and 98678 transitions. [2024-11-10 01:00:13,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 01:00:13,323 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.238095238095237) internal successors, (236), 20 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-10 01:00:13,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:13,380 INFO L225 Difference]: With dead ends: 70217 [2024-11-10 01:00:13,380 INFO L226 Difference]: Without dead ends: 49574 [2024-11-10 01:00:13,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2024-11-10 01:00:13,393 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 15767 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15767 SdHoareTripleChecker+Valid, 7098 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:13,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15767 Valid, 7098 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:00:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49574 states. [2024-11-10 01:00:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49574 to 49088. [2024-11-10 01:00:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49088 states, 49086 states have (on average 1.4381289980849936) internal successors, (70592), 49087 states have internal predecessors, (70592), 0 states have call successors, (0), 0 states have 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:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49088 states to 49088 states and 70592 transitions. [2024-11-10 01:00:14,591 INFO L78 Accepts]: Start accepts. Automaton has 49088 states and 70592 transitions. Word has length 110 [2024-11-10 01:00:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:14,591 INFO L471 AbstractCegarLoop]: Abstraction has 49088 states and 70592 transitions. [2024-11-10 01:00:14,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.238095238095237) internal successors, (236), 20 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:00:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 49088 states and 70592 transitions. [2024-11-10 01:00:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 01:00:14,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:14,600 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:00:14,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 01:00:14,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 01:00:14,801 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:14,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:14,803 INFO L85 PathProgramCache]: Analyzing trace with hash -885277778, now seen corresponding path program 1 times [2024-11-10 01:00:14,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:14,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336861994] [2024-11-10 01:00:14,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:14,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:15,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336861994] [2024-11-10 01:00:15,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336861994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:00:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300611327] [2024-11-10 01:00:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:15,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:00:15,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:00:15,824 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:00:15,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 01:00:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:15,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 01:00:16,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:00:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:18,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:00:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:20,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300611327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:00:20,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 01:00:20,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 39 [2024-11-10 01:00:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783947615] [2024-11-10 01:00:20,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 01:00:20,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-10 01:00:20,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:20,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-10 01:00:20,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1336, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 01:00:20,645 INFO L87 Difference]: Start difference. First operand 49088 states and 70592 transitions. Second operand has 40 states, 40 states have (on average 7.3) internal successors, (292), 39 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)