./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca658a8a4271e1b6abd8c554fa2f86da0f765323e5a4dbf7051e477838d5322c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:51:45,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:51:45,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:51:45,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:51:45,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:51:45,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:51:45,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:51:45,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:51:45,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:51:45,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:51:45,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:51:45,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:51:45,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:51:45,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:51:45,626 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:51:45,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:51:45,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:51:45,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:51:45,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:51:45,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:51:45,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:51:45,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:51:45,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:51:45,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:51:45,635 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:51:45,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:51:45,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:51:45,635 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:51:45,636 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:51:45,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:51:45,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:51:45,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:51:45,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:51:45,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:51:45,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:51:45,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:51:45,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:51:45,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:51:45,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:51:45,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:51:45,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:51:45,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:51:45,639 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 -> ca658a8a4271e1b6abd8c554fa2f86da0f765323e5a4dbf7051e477838d5322c [2024-11-10 00:51:45,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:51:45,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:51:45,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:51:45,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:51:45,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:51:45,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 00:51:47,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:51:47,909 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:51:47,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 00:51:47,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6280defe4/c9546cf2683b44b28d88564a39152500/FLAG930be81d9 [2024-11-10 00:51:47,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6280defe4/c9546cf2683b44b28d88564a39152500 [2024-11-10 00:51:47,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:51:47,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:51:47,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:51:47,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:51:47,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:51:47,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:51:47" (1/1) ... [2024-11-10 00:51:47,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1cf37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:47, skipping insertion in model container [2024-11-10 00:51:47,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:51:47" (1/1) ... [2024-11-10 00:51:48,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:51:48,422 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.4.ufo.UNBOUNDED.pals+Problem12_label02.c[8712,8725] [2024-11-10 00:51:48,475 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.4.ufo.UNBOUNDED.pals+Problem12_label02.c[16002,16015] [2024-11-10 00:51:49,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:51:49,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:51:49,239 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.4.ufo.UNBOUNDED.pals+Problem12_label02.c[8712,8725] [2024-11-10 00:51:49,254 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.4.ufo.UNBOUNDED.pals+Problem12_label02.c[16002,16015] [2024-11-10 00:51:49,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:51:49,706 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:51:49,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49 WrapperNode [2024-11-10 00:51:49,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:51:49,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:51:49,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:51:49,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:51:49,715 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:51:49" (1/1) ... [2024-11-10 00:51:49,774 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:51:49" (1/1) ... [2024-11-10 00:51:50,069 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5037 [2024-11-10 00:51:50,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:51:50,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:51:50,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:51:50,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:51:50,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (1/1) ... [2024-11-10 00:51:50,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (1/1) ... [2024-11-10 00:51:50,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (1/1) ... [2024-11-10 00:51:50,364 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:51:50,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (1/1) ... [2024-11-10 00:51:50,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (1/1) ... [2024-11-10 00:51:50,595 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (1/1) ... [2024-11-10 00:51:50,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (1/1) ... [2024-11-10 00:51:50,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (1/1) ... [2024-11-10 00:51:50,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (1/1) ... [2024-11-10 00:51:50,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:51:50,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:51:50,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:51:50,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:51:50,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (1/1) ... [2024-11-10 00:51:50,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:51:50,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:51:50,773 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:51:50,776 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:51:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:51:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:51:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:51:50,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:51:50,927 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:51:50,930 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:51:56,161 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2024-11-10 00:51:56,161 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2024-11-10 00:51:56,162 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2024-11-10 00:51:56,539 INFO L? ?]: Removed 2076 outVars from TransFormulas that were not future-live. [2024-11-10 00:51:56,540 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:51:56,587 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:51:56,589 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:51:56,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:51:56 BoogieIcfgContainer [2024-11-10 00:51:56,589 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:51:56,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:51:56,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:51:56,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:51:56,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:51:47" (1/3) ... [2024-11-10 00:51:56,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3035d19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:51:56, skipping insertion in model container [2024-11-10 00:51:56,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:49" (2/3) ... [2024-11-10 00:51:56,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3035d19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:51:56, skipping insertion in model container [2024-11-10 00:51:56,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:51:56" (3/3) ... [2024-11-10 00:51:56,601 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 00:51:56,617 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:51:56,618 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:51:56,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:51:56,724 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;@5beff34a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:51:56,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:51:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 894 states, 891 states have (on average 2.6610549943883277) internal successors, (2371), 893 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have 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:51:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:51:56,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:56,744 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] [2024-11-10 00:51:56,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:56,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:56,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1060858498, now seen corresponding path program 1 times [2024-11-10 00:51:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:56,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638578281] [2024-11-10 00:51:56,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:56,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:57,044 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:51:57,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:57,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638578281] [2024-11-10 00:51:57,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638578281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:51:57,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:51:57,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:51:57,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919113883] [2024-11-10 00:51:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:51:57,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:51:57,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:51:57,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:51:57,088 INFO L87 Difference]: Start difference. First operand has 894 states, 891 states have (on average 2.6610549943883277) internal successors, (2371), 893 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:51:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:57,195 INFO L93 Difference]: Finished difference Result 1755 states and 4684 transitions. [2024-11-10 00:51:57,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:51:57,199 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-10 00:51:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:57,219 INFO L225 Difference]: With dead ends: 1755 [2024-11-10 00:51:57,219 INFO L226 Difference]: Without dead ends: 826 [2024-11-10 00:51:57,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:51:57,228 INFO L432 NwaCegarLoop]: 2300 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:57,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:51:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-10 00:51:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2024-11-10 00:51:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 824 states have (on average 2.7135922330097086) internal successors, (2236), 825 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have 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:51:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2236 transitions. [2024-11-10 00:51:57,320 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2236 transitions. Word has length 24 [2024-11-10 00:51:57,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:57,321 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 2236 transitions. [2024-11-10 00:51:57,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:51:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2236 transitions. [2024-11-10 00:51:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:51:57,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:57,327 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] [2024-11-10 00:51:57,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:51:57,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:57,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:57,328 INFO L85 PathProgramCache]: Analyzing trace with hash 63786145, now seen corresponding path program 1 times [2024-11-10 00:51:57,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:57,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749810424] [2024-11-10 00:51:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:57,581 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:51:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:57,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749810424] [2024-11-10 00:51:57,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749810424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:51:57,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:51:57,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:51:57,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973180230] [2024-11-10 00:51:57,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:51:57,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:51:57,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:57,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:51:57,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:51:57,587 INFO L87 Difference]: Start difference. First operand 826 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:51:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:57,721 INFO L93 Difference]: Finished difference Result 871 states and 2303 transitions. [2024-11-10 00:51:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:51:57,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-10 00:51:57,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:57,728 INFO L225 Difference]: With dead ends: 871 [2024-11-10 00:51:57,729 INFO L226 Difference]: Without dead ends: 826 [2024-11-10 00:51:57,730 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:51:57,731 INFO L432 NwaCegarLoop]: 2234 mSDtfsCounter, 0 mSDsluCounter, 6674 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8908 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:57,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8908 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:51:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-10 00:51:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2024-11-10 00:51:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 824 states have (on average 2.6856796116504853) internal successors, (2213), 825 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have 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:51:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2213 transitions. [2024-11-10 00:51:57,779 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2213 transitions. Word has length 24 [2024-11-10 00:51:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:57,779 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 2213 transitions. [2024-11-10 00:51:57,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:51:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2213 transitions. [2024-11-10 00:51:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 00:51:57,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:57,784 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] [2024-11-10 00:51:57,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:51:57,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:57,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:57,787 INFO L85 PathProgramCache]: Analyzing trace with hash -38432181, now seen corresponding path program 1 times [2024-11-10 00:51:57,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:57,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073229026] [2024-11-10 00:51:57,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:57,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:58,040 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:51:58,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:58,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073229026] [2024-11-10 00:51:58,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073229026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:51:58,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:51:58,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:51:58,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130943803] [2024-11-10 00:51:58,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:51:58,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:51:58,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:58,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:51:58,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:51:58,043 INFO L87 Difference]: Start difference. First operand 826 states and 2213 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:51:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:58,269 INFO L93 Difference]: Finished difference Result 1154 states and 2717 transitions. [2024-11-10 00:51:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:51:58,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-10 00:51:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:58,279 INFO L225 Difference]: With dead ends: 1154 [2024-11-10 00:51:58,279 INFO L226 Difference]: Without dead ends: 1113 [2024-11-10 00:51:58,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:51:58,284 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 9037 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9037 SdHoareTripleChecker+Valid, 2853 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:58,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9037 Valid, 2853 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:51:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-10 00:51:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 864. [2024-11-10 00:51:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 2.6357308584686776) internal successors, (2272), 863 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have 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:51:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2272 transitions. [2024-11-10 00:51:58,315 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2272 transitions. Word has length 46 [2024-11-10 00:51:58,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:58,315 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 2272 transitions. [2024-11-10 00:51:58,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:51:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2272 transitions. [2024-11-10 00:51:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 00:51:58,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:58,320 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] [2024-11-10 00:51:58,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:51:58,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:58,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash -284227027, now seen corresponding path program 1 times [2024-11-10 00:51:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:58,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970749622] [2024-11-10 00:51:58,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:58,593 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:51:58,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:58,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970749622] [2024-11-10 00:51:58,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970749622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:51:58,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:51:58,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:51:58,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574337687] [2024-11-10 00:51:58,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:51:58,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:51:58,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:58,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:51:58,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:51:58,597 INFO L87 Difference]: Start difference. First operand 864 states and 2272 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:51:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:58,742 INFO L93 Difference]: Finished difference Result 946 states and 2396 transitions. [2024-11-10 00:51:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:51:58,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-10 00:51:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:58,748 INFO L225 Difference]: With dead ends: 946 [2024-11-10 00:51:58,748 INFO L226 Difference]: Without dead ends: 867 [2024-11-10 00:51:58,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:51:58,753 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 4342 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4342 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:58,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4342 Valid, 2384 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:51:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-11-10 00:51:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 864. [2024-11-10 00:51:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 2.6345707656612527) internal successors, (2271), 863 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have 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:51:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2271 transitions. [2024-11-10 00:51:58,775 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2271 transitions. Word has length 48 [2024-11-10 00:51:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:58,776 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 2271 transitions. [2024-11-10 00:51:58,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:51:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2271 transitions. [2024-11-10 00:51:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 00:51:58,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:58,778 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] [2024-11-10 00:51:58,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:51:58,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:58,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:58,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1502715960, now seen corresponding path program 1 times [2024-11-10 00:51:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:58,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636154507] [2024-11-10 00:51:58,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:58,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:58,862 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:51:58,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636154507] [2024-11-10 00:51:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636154507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:51:58,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:51:58,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:51:58,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098770190] [2024-11-10 00:51:58,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:51:58,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:51:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:58,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:51:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:51:58,866 INFO L87 Difference]: Start difference. First operand 864 states and 2271 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:51:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:58,908 INFO L93 Difference]: Finished difference Result 1010 states and 2493 transitions. [2024-11-10 00:51:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:51:58,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-10 00:51:58,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:58,915 INFO L225 Difference]: With dead ends: 1010 [2024-11-10 00:51:58,915 INFO L226 Difference]: Without dead ends: 931 [2024-11-10 00:51:58,917 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:51:58,918 INFO L432 NwaCegarLoop]: 2209 mSDtfsCounter, 2160 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2265 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:51:58,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2265 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:51:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-10 00:51:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 926. [2024-11-10 00:51:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 924 states have (on average 2.5573593073593073) internal successors, (2363), 925 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have 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:51:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 2363 transitions. [2024-11-10 00:51:58,942 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 2363 transitions. Word has length 49 [2024-11-10 00:51:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:58,942 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 2363 transitions. [2024-11-10 00:51:58,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:51:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 2363 transitions. [2024-11-10 00:51:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:51:58,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:58,944 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] [2024-11-10 00:51:58,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:51:58,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:58,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:58,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1220941777, now seen corresponding path program 1 times [2024-11-10 00:51:58,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:58,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578800658] [2024-11-10 00:51:58,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:58,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:59,046 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:51:59,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:59,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578800658] [2024-11-10 00:51:59,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578800658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:51:59,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:51:59,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:51:59,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594835097] [2024-11-10 00:51:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:51:59,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:51:59,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:59,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:51:59,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:51:59,049 INFO L87 Difference]: Start difference. First operand 926 states and 2363 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:51:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:59,083 INFO L93 Difference]: Finished difference Result 1192 states and 2761 transitions. [2024-11-10 00:51:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:51:59,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:51:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:59,088 INFO L225 Difference]: With dead ends: 1192 [2024-11-10 00:51:59,088 INFO L226 Difference]: Without dead ends: 1051 [2024-11-10 00:51:59,089 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:51:59,089 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 2171 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 2320 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:51:59,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 2320 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:51:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-11-10 00:51:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1048. [2024-11-10 00:51:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1046 states have (on average 2.4302103250478013) internal successors, (2542), 1047 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have 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:51:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2542 transitions. [2024-11-10 00:51:59,120 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2542 transitions. Word has length 50 [2024-11-10 00:51:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:59,122 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 2542 transitions. [2024-11-10 00:51:59,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:51:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2542 transitions. [2024-11-10 00:51:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:51:59,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:59,123 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] [2024-11-10 00:51:59,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:51:59,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:59,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1235391633, now seen corresponding path program 1 times [2024-11-10 00:51:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:59,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822376407] [2024-11-10 00:51:59,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:59,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:59,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:51:59,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822376407] [2024-11-10 00:51:59,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822376407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:51:59,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:51:59,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:51:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501722406] [2024-11-10 00:51:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:51:59,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:51:59,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:59,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:51:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:51:59,194 INFO L87 Difference]: Start difference. First operand 1048 states and 2542 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:51:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:59,234 INFO L93 Difference]: Finished difference Result 1542 states and 3270 transitions. [2024-11-10 00:51:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:51:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:51:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:59,240 INFO L225 Difference]: With dead ends: 1542 [2024-11-10 00:51:59,240 INFO L226 Difference]: Without dead ends: 1279 [2024-11-10 00:51:59,241 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:51:59,242 INFO L432 NwaCegarLoop]: 2250 mSDtfsCounter, 2169 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 2322 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:51:59,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 2322 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:51:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-11-10 00:51:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1276. [2024-11-10 00:51:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1274 states have (on average 2.2511773940345368) internal successors, (2868), 1275 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have 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:51:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 2868 transitions. [2024-11-10 00:51:59,270 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 2868 transitions. Word has length 50 [2024-11-10 00:51:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:59,271 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 2868 transitions. [2024-11-10 00:51:59,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:51:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 2868 transitions. [2024-11-10 00:51:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:51:59,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:59,272 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] [2024-11-10 00:51:59,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:51:59,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:59,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash 856211119, now seen corresponding path program 1 times [2024-11-10 00:51:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:59,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213195707] [2024-11-10 00:51:59,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:59,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:59,335 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:51:59,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:59,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213195707] [2024-11-10 00:51:59,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213195707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:51:59,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:51:59,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:51:59,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881742184] [2024-11-10 00:51:59,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:51:59,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:51:59,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:51:59,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:51:59,338 INFO L87 Difference]: Start difference. First operand 1276 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:51:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:59,378 INFO L93 Difference]: Finished difference Result 2194 states and 4192 transitions. [2024-11-10 00:51:59,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:51:59,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:51:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:59,385 INFO L225 Difference]: With dead ends: 2194 [2024-11-10 00:51:59,386 INFO L226 Difference]: Without dead ends: 1703 [2024-11-10 00:51:59,387 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:51:59,388 INFO L432 NwaCegarLoop]: 2248 mSDtfsCounter, 2167 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2167 SdHoareTripleChecker+Valid, 2324 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:51:59,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2167 Valid, 2324 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:51:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-11-10 00:51:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1700. [2024-11-10 00:51:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1698 states have (on average 2.035335689045936) internal successors, (3456), 1699 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have 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:51:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 3456 transitions. [2024-11-10 00:51:59,426 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 3456 transitions. Word has length 50 [2024-11-10 00:51:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:59,426 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 3456 transitions. [2024-11-10 00:51:59,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:51:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 3456 transitions. [2024-11-10 00:51:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:51:59,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:59,428 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] [2024-11-10 00:51:59,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:51:59,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:59,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:59,429 INFO L85 PathProgramCache]: Analyzing trace with hash 331934064, now seen corresponding path program 1 times [2024-11-10 00:51:59,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:59,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441525970] [2024-11-10 00:51:59,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:59,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:59,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:59,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441525970] [2024-11-10 00:51:59,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441525970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:51:59,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:51:59,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:51:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565013645] [2024-11-10 00:51:59,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:51:59,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:51:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:59,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:51:59,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:51:59,624 INFO L87 Difference]: Start difference. First operand 1700 states and 3456 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:51:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:59,684 INFO L93 Difference]: Finished difference Result 1751 states and 3522 transitions. [2024-11-10 00:51:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:51:59,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:51:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:59,692 INFO L225 Difference]: With dead ends: 1751 [2024-11-10 00:51:59,692 INFO L226 Difference]: Without dead ends: 1748 [2024-11-10 00:51:59,693 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:51:59,693 INFO L432 NwaCegarLoop]: 2210 mSDtfsCounter, 0 mSDsluCounter, 6621 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8831 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:59,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8831 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:51:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2024-11-10 00:51:59,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1748. [2024-11-10 00:51:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1746 states have (on average 2.002290950744559) internal successors, (3496), 1747 states have internal predecessors, (3496), 0 states have call successors, (0), 0 states have 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:51:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 3496 transitions. [2024-11-10 00:51:59,731 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 3496 transitions. Word has length 50 [2024-11-10 00:51:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:59,732 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 3496 transitions. [2024-11-10 00:51:59,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:51:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 3496 transitions. [2024-11-10 00:51:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 00:51:59,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:59,733 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] [2024-11-10 00:51:59,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:51:59,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:59,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash 922171759, now seen corresponding path program 1 times [2024-11-10 00:51:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408875992] [2024-11-10 00:51:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:59,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:59,780 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:51:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:59,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408875992] [2024-11-10 00:51:59,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408875992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:51:59,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:51:59,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:51:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253828436] [2024-11-10 00:51:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:51:59,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:51:59,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:51:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:51:59,783 INFO L87 Difference]: Start difference. First operand 1748 states and 3496 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:51:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:59,827 INFO L93 Difference]: Finished difference Result 2782 states and 4961 transitions. [2024-11-10 00:51:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:51:59,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-10 00:51:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:59,836 INFO L225 Difference]: With dead ends: 2782 [2024-11-10 00:51:59,836 INFO L226 Difference]: Without dead ends: 2218 [2024-11-10 00:51:59,837 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:51:59,838 INFO L432 NwaCegarLoop]: 2257 mSDtfsCounter, 2170 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2321 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:51:59,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:51:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2024-11-10 00:51:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2215. [2024-11-10 00:51:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2213 states have (on average 1.8666967916854948) internal successors, (4131), 2214 states have internal predecessors, (4131), 0 states have call successors, (0), 0 states have 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:51:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 4131 transitions. [2024-11-10 00:51:59,887 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 4131 transitions. Word has length 52 [2024-11-10 00:51:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:59,887 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 4131 transitions. [2024-11-10 00:51:59,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:51:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 4131 transitions. [2024-11-10 00:51:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:51:59,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:59,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:51:59,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:51:59,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:59,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash -569538483, now seen corresponding path program 1 times [2024-11-10 00:51:59,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:59,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206803227] [2024-11-10 00:51:59,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:59,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:00,016 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:52:00,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206803227] [2024-11-10 00:52:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206803227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:00,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:00,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827971975] [2024-11-10 00:52:00,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:00,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:52:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:00,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:52:00,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:52:00,019 INFO L87 Difference]: Start difference. First operand 2215 states and 4131 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:07,717 INFO L93 Difference]: Finished difference Result 4474 states and 10484 transitions. [2024-11-10 00:52:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:52:07,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 00:52:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:07,733 INFO L225 Difference]: With dead ends: 4474 [2024-11-10 00:52:07,733 INFO L226 Difference]: Without dead ends: 3719 [2024-11-10 00:52:07,736 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:52:07,736 INFO L432 NwaCegarLoop]: 769 mSDtfsCounter, 4413 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8074 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4413 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 9227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 8074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:07,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4413 Valid, 792 Invalid, 9227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 8074 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-10 00:52:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2024-11-10 00:52:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3719. [2024-11-10 00:52:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3717 states have (on average 2.0465429109496904) internal successors, (7607), 3718 states have internal predecessors, (7607), 0 states have call successors, (0), 0 states have 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:52:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 7607 transitions. [2024-11-10 00:52:07,822 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 7607 transitions. Word has length 65 [2024-11-10 00:52:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:07,822 INFO L471 AbstractCegarLoop]: Abstraction has 3719 states and 7607 transitions. [2024-11-10 00:52:07,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 7607 transitions. [2024-11-10 00:52:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:07,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:07,824 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] [2024-11-10 00:52:07,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:52:07,825 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:07,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1969902973, now seen corresponding path program 1 times [2024-11-10 00:52:07,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:07,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659027842] [2024-11-10 00:52:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:52:07,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:07,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659027842] [2024-11-10 00:52:07,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659027842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:07,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:07,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:07,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918814187] [2024-11-10 00:52:07,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:07,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:07,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:07,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:07,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:07,967 INFO L87 Difference]: Start difference. First operand 3719 states and 7607 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:08,304 INFO L93 Difference]: Finished difference Result 9750 states and 15945 transitions. [2024-11-10 00:52:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:08,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:52:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:08,336 INFO L225 Difference]: With dead ends: 9750 [2024-11-10 00:52:08,336 INFO L226 Difference]: Without dead ends: 8323 [2024-11-10 00:52:08,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:08,344 INFO L432 NwaCegarLoop]: 2271 mSDtfsCounter, 6723 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6723 SdHoareTripleChecker+Valid, 4756 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:08,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6723 Valid, 4756 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8323 states. [2024-11-10 00:52:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8323 to 5143. [2024-11-10 00:52:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5143 states, 5141 states have (on average 1.8593658821241004) internal successors, (9559), 5142 states have internal predecessors, (9559), 0 states have call successors, (0), 0 states have 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:52:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5143 states to 5143 states and 9559 transitions. [2024-11-10 00:52:08,551 INFO L78 Accepts]: Start accepts. Automaton has 5143 states and 9559 transitions. Word has length 69 [2024-11-10 00:52:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:08,551 INFO L471 AbstractCegarLoop]: Abstraction has 5143 states and 9559 transitions. [2024-11-10 00:52:08,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5143 states and 9559 transitions. [2024-11-10 00:52:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:08,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:08,554 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] [2024-11-10 00:52:08,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:52:08,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:08,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1955453117, now seen corresponding path program 1 times [2024-11-10 00:52:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:08,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613022059] [2024-11-10 00:52:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:08,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:52:08,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:08,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613022059] [2024-11-10 00:52:08,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613022059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:08,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:08,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80532910] [2024-11-10 00:52:08,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:08,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:08,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:08,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:08,720 INFO L87 Difference]: Start difference. First operand 5143 states and 9559 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:52:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:09,050 INFO L93 Difference]: Finished difference Result 11174 states and 17897 transitions. [2024-11-10 00:52:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:09,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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:52:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:09,074 INFO L225 Difference]: With dead ends: 11174 [2024-11-10 00:52:09,074 INFO L226 Difference]: Without dead ends: 9747 [2024-11-10 00:52:09,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:09,082 INFO L432 NwaCegarLoop]: 2267 mSDtfsCounter, 6750 mSDsluCounter, 2435 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6750 SdHoareTripleChecker+Valid, 4702 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:09,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6750 Valid, 4702 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9747 states. [2024-11-10 00:52:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9747 to 7287. [2024-11-10 00:52:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7287 states, 7285 states have (on average 1.7118737131091284) internal successors, (12471), 7286 states have internal predecessors, (12471), 0 states have call successors, (0), 0 states have 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:52:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7287 states to 7287 states and 12471 transitions. [2024-11-10 00:52:09,310 INFO L78 Accepts]: Start accepts. Automaton has 7287 states and 12471 transitions. Word has length 69 [2024-11-10 00:52:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:09,310 INFO L471 AbstractCegarLoop]: Abstraction has 7287 states and 12471 transitions. [2024-11-10 00:52:09,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:52:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 7287 states and 12471 transitions. [2024-11-10 00:52:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:09,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:09,316 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] [2024-11-10 00:52:09,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:52:09,317 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:09,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:09,317 INFO L85 PathProgramCache]: Analyzing trace with hash -247911427, now seen corresponding path program 1 times [2024-11-10 00:52:09,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:09,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960596838] [2024-11-10 00:52:09,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:09,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:52:09,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:09,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960596838] [2024-11-10 00:52:09,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960596838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:09,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:09,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:09,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114559883] [2024-11-10 00:52:09,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:09,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:09,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:09,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:09,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:09,451 INFO L87 Difference]: Start difference. First operand 7287 states and 12471 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:52:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:09,696 INFO L93 Difference]: Finished difference Result 12598 states and 19849 transitions. [2024-11-10 00:52:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:09,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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:52:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:09,719 INFO L225 Difference]: With dead ends: 12598 [2024-11-10 00:52:09,719 INFO L226 Difference]: Without dead ends: 11171 [2024-11-10 00:52:09,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:09,727 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 6733 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6733 SdHoareTripleChecker+Valid, 4725 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:09,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6733 Valid, 4725 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11171 states. [2024-11-10 00:52:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11171 to 8711. [2024-11-10 00:52:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8711 states, 8709 states have (on average 1.6561028820760133) internal successors, (14423), 8710 states have internal predecessors, (14423), 0 states have call successors, (0), 0 states have 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:52:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 14423 transitions. [2024-11-10 00:52:09,981 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 14423 transitions. Word has length 69 [2024-11-10 00:52:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:09,981 INFO L471 AbstractCegarLoop]: Abstraction has 8711 states and 14423 transitions. [2024-11-10 00:52:09,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:52:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 14423 transitions. [2024-11-10 00:52:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:52:09,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:09,984 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] [2024-11-10 00:52:09,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:52:09,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:09,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1285540063, now seen corresponding path program 1 times [2024-11-10 00:52:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253697162] [2024-11-10 00:52:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:10,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:10,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253697162] [2024-11-10 00:52:10,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253697162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:10,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425613519] [2024-11-10 00:52:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:10,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:10,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:10,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:10,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:10,074 INFO L87 Difference]: Start difference. First operand 8711 states and 14423 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:52:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:10,170 INFO L93 Difference]: Finished difference Result 13345 states and 20856 transitions. [2024-11-10 00:52:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:10,170 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:52:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:10,184 INFO L225 Difference]: With dead ends: 13345 [2024-11-10 00:52:10,185 INFO L226 Difference]: Without dead ends: 6926 [2024-11-10 00:52:10,194 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:52:10,195 INFO L432 NwaCegarLoop]: 2247 mSDtfsCounter, 43 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4445 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:52:10,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4445 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6926 states. [2024-11-10 00:52:10,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6926 to 6923. [2024-11-10 00:52:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6923 states, 6921 states have (on average 1.7319751480999857) internal successors, (11987), 6922 states have internal predecessors, (11987), 0 states have call successors, (0), 0 states have 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:52:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6923 states to 6923 states and 11987 transitions. [2024-11-10 00:52:10,330 INFO L78 Accepts]: Start accepts. Automaton has 6923 states and 11987 transitions. Word has length 71 [2024-11-10 00:52:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:10,331 INFO L471 AbstractCegarLoop]: Abstraction has 6923 states and 11987 transitions. [2024-11-10 00:52:10,331 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:52:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6923 states and 11987 transitions. [2024-11-10 00:52:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:52:10,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:10,332 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] [2024-11-10 00:52:10,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:52:10,333 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:10,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash 717327165, now seen corresponding path program 1 times [2024-11-10 00:52:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:10,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181409691] [2024-11-10 00:52:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:52:10,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:10,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181409691] [2024-11-10 00:52:10,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181409691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:10,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:10,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:10,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901081771] [2024-11-10 00:52:10,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:10,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:10,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:10,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:10,457 INFO L87 Difference]: Start difference. First operand 6923 states and 11987 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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:52:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:10,669 INFO L93 Difference]: Finished difference Result 11034 states and 17693 transitions. [2024-11-10 00:52:10,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:10,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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 71 [2024-11-10 00:52:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:10,688 INFO L225 Difference]: With dead ends: 11034 [2024-11-10 00:52:10,689 INFO L226 Difference]: Without dead ends: 10007 [2024-11-10 00:52:10,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:10,695 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 6731 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6731 SdHoareTripleChecker+Valid, 4797 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:10,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6731 Valid, 4797 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10007 states. [2024-11-10 00:52:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10007 to 7947. [2024-11-10 00:52:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7947 states, 7945 states have (on average 1.685966016362492) internal successors, (13395), 7946 states have internal predecessors, (13395), 0 states have call successors, (0), 0 states have 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:52:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7947 states to 7947 states and 13395 transitions. [2024-11-10 00:52:10,884 INFO L78 Accepts]: Start accepts. Automaton has 7947 states and 13395 transitions. Word has length 71 [2024-11-10 00:52:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:10,885 INFO L471 AbstractCegarLoop]: Abstraction has 7947 states and 13395 transitions. [2024-11-10 00:52:10,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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:52:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 13395 transitions. [2024-11-10 00:52:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:52:10,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:10,887 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] [2024-11-10 00:52:10,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:52:10,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:10,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash 151031455, now seen corresponding path program 1 times [2024-11-10 00:52:10,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:10,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274767152] [2024-11-10 00:52:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274767152] [2024-11-10 00:52:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274767152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:11,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:11,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:11,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117429192] [2024-11-10 00:52:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:11,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:11,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:11,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:11,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:11,061 INFO L87 Difference]: Start difference. First operand 7947 states and 13395 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:52:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:11,133 INFO L93 Difference]: Finished difference Result 10769 states and 17271 transitions. [2024-11-10 00:52:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:11,133 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:52:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:11,144 INFO L225 Difference]: With dead ends: 10769 [2024-11-10 00:52:11,145 INFO L226 Difference]: Without dead ends: 5134 [2024-11-10 00:52:11,152 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:52:11,153 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 36 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4430 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:52:11,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4430 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2024-11-10 00:52:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 5131. [2024-11-10 00:52:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5131 states, 5129 states have (on average 1.848118541626048) internal successors, (9479), 5130 states have internal predecessors, (9479), 0 states have call successors, (0), 0 states have 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:52:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5131 states to 5131 states and 9479 transitions. [2024-11-10 00:52:11,255 INFO L78 Accepts]: Start accepts. Automaton has 5131 states and 9479 transitions. Word has length 73 [2024-11-10 00:52:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:11,255 INFO L471 AbstractCegarLoop]: Abstraction has 5131 states and 9479 transitions. [2024-11-10 00:52:11,256 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:52:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5131 states and 9479 transitions. [2024-11-10 00:52:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:52:11,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:11,257 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] [2024-11-10 00:52:11,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:52:11,257 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:11,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:11,258 INFO L85 PathProgramCache]: Analyzing trace with hash 450631713, now seen corresponding path program 1 times [2024-11-10 00:52:11,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:11,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533741851] [2024-11-10 00:52:11,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:11,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:11,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533741851] [2024-11-10 00:52:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533741851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:11,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:11,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:11,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101090389] [2024-11-10 00:52:11,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:11,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:11,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:11,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:11,351 INFO L87 Difference]: Start difference. First operand 5131 states and 9479 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:52:11,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:11,402 INFO L93 Difference]: Finished difference Result 6545 states and 11397 transitions. [2024-11-10 00:52:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:11,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-11-10 00:52:11,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:11,410 INFO L225 Difference]: With dead ends: 6545 [2024-11-10 00:52:11,411 INFO L226 Difference]: Without dead ends: 3726 [2024-11-10 00:52:11,415 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:52:11,415 INFO L432 NwaCegarLoop]: 2233 mSDtfsCounter, 31 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 4415 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:52:11,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 4415 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2024-11-10 00:52:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3723. [2024-11-10 00:52:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3723 states, 3721 states have (on average 2.02714324106423) internal successors, (7543), 3722 states have internal predecessors, (7543), 0 states have call successors, (0), 0 states have 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:52:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 7543 transitions. [2024-11-10 00:52:11,488 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 7543 transitions. Word has length 75 [2024-11-10 00:52:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:11,488 INFO L471 AbstractCegarLoop]: Abstraction has 3723 states and 7543 transitions. [2024-11-10 00:52:11,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:52:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 7543 transitions. [2024-11-10 00:52:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:52:11,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:11,491 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:11,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:52:11,492 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:11,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:11,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1411349864, now seen corresponding path program 1 times [2024-11-10 00:52:11,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:11,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318450145] [2024-11-10 00:52:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:11,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318450145] [2024-11-10 00:52:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318450145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:11,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:11,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272147360] [2024-11-10 00:52:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:11,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:11,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:11,587 INFO L87 Difference]: Start difference. First operand 3723 states and 7543 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:52:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:11,630 INFO L93 Difference]: Finished difference Result 4433 states and 8493 transitions. [2024-11-10 00:52:11,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:11,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-10 00:52:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:11,637 INFO L225 Difference]: With dead ends: 4433 [2024-11-10 00:52:11,638 INFO L226 Difference]: Without dead ends: 3022 [2024-11-10 00:52:11,640 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:52:11,641 INFO L432 NwaCegarLoop]: 2226 mSDtfsCounter, 28 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4400 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:52:11,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4400 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2024-11-10 00:52:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3019. [2024-11-10 00:52:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 3017 states have (on average 2.1829632084852504) internal successors, (6586), 3018 states have internal predecessors, (6586), 0 states have call successors, (0), 0 states have 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:52:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 6586 transitions. [2024-11-10 00:52:11,699 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 6586 transitions. Word has length 77 [2024-11-10 00:52:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:11,699 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 6586 transitions. [2024-11-10 00:52:11,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:52:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 6586 transitions. [2024-11-10 00:52:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:52:11,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:11,702 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:11,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:52:11,703 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash -575781937, now seen corresponding path program 1 times [2024-11-10 00:52:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014312279] [2024-11-10 00:52:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:12,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014312279] [2024-11-10 00:52:12,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014312279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:12,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88917047] [2024-11-10 00:52:12,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:12,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:12,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:12,156 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 00:52:12,157 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 00:52:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:12,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:52:12,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:12,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88917047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:13,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:13,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-10 00:52:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931979579] [2024-11-10 00:52:13,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:13,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 00:52:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:13,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 00:52:13,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:52:13,918 INFO L87 Difference]: Start difference. First operand 3019 states and 6586 transitions. Second operand has 22 states, 22 states have (on average 8.409090909090908) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have 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:52:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:14,411 INFO L93 Difference]: Finished difference Result 4502 states and 8561 transitions. [2024-11-10 00:52:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:52:14,412 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.409090909090908) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 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:52:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:14,422 INFO L225 Difference]: With dead ends: 4502 [2024-11-10 00:52:14,422 INFO L226 Difference]: Without dead ends: 3795 [2024-11-10 00:52:14,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:52:14,426 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 19832 mSDsluCounter, 6753 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19832 SdHoareTripleChecker+Valid, 8941 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:14,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19832 Valid, 8941 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:52:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2024-11-10 00:52:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 3767. [2024-11-10 00:52:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3767 states, 3765 states have (on average 2.006374501992032) internal successors, (7554), 3766 states have internal predecessors, (7554), 0 states have call successors, (0), 0 states have 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:52:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 7554 transitions. [2024-11-10 00:52:14,504 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 7554 transitions. Word has length 79 [2024-11-10 00:52:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:14,504 INFO L471 AbstractCegarLoop]: Abstraction has 3767 states and 7554 transitions. [2024-11-10 00:52:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.409090909090908) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have 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:52:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 7554 transitions. [2024-11-10 00:52:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:52:14,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:14,506 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:14,527 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 00:52:14,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:14,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:14,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2128623729, now seen corresponding path program 1 times [2024-11-10 00:52:14,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:14,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895654420] [2024-11-10 00:52:14,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:14,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:15,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:15,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895654420] [2024-11-10 00:52:15,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895654420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:15,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466566280] [2024-11-10 00:52:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:15,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:15,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:15,293 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 00:52:15,295 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 00:52:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:15,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:52:15,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:15,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:16,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466566280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:16,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:16,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-10 00:52:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199881307] [2024-11-10 00:52:16,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:16,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 00:52:16,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 00:52:16,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:52:16,861 INFO L87 Difference]: Start difference. First operand 3767 states and 7554 transitions. Second operand has 21 states, 21 states have (on average 8.0) internal successors, (168), 20 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have 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:52:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:17,561 INFO L93 Difference]: Finished difference Result 6812 states and 11564 transitions. [2024-11-10 00:52:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:52:17,562 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.0) internal successors, (168), 20 states have internal predecessors, (168), 0 states have call successors, (0), 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:52:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:17,574 INFO L225 Difference]: With dead ends: 6812 [2024-11-10 00:52:17,574 INFO L226 Difference]: Without dead ends: 5357 [2024-11-10 00:52:17,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:52:17,580 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 19981 mSDsluCounter, 6902 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19981 SdHoareTripleChecker+Valid, 9090 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:17,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19981 Valid, 9090 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:52:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states. [2024-11-10 00:52:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 5307. [2024-11-10 00:52:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5307 states, 5305 states have (on average 1.7950989632422243) internal successors, (9523), 5306 states have internal predecessors, (9523), 0 states have call successors, (0), 0 states have 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:52:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 9523 transitions. [2024-11-10 00:52:17,697 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 9523 transitions. Word has length 79 [2024-11-10 00:52:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:17,697 INFO L471 AbstractCegarLoop]: Abstraction has 5307 states and 9523 transitions. [2024-11-10 00:52:17,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.0) internal successors, (168), 20 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have 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:52:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 9523 transitions. [2024-11-10 00:52:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:52:17,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:17,699 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:17,718 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 00:52:17,900 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,SelfDestructingSolverStorable20 [2024-11-10 00:52:17,901 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:17,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1300649617, now seen corresponding path program 1 times [2024-11-10 00:52:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:17,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257644013] [2024-11-10 00:52:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:18,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:18,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257644013] [2024-11-10 00:52:18,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257644013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:18,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815531318] [2024-11-10 00:52:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:18,984 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 00:52:18,985 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 00:52:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:19,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:52:19,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:19,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815531318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:20,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 13] total 32 [2024-11-10 00:52:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200850005] [2024-11-10 00:52:20,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:20,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 00:52:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 00:52:20,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:52:20,998 INFO L87 Difference]: Start difference. First operand 5307 states and 9523 transitions. Second operand has 32 states, 32 states have (on average 6.71875) internal successors, (215), 32 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have 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:52:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:23,311 INFO L93 Difference]: Finished difference Result 17912 states and 25839 transitions. [2024-11-10 00:52:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-10 00:52:23,314 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.71875) internal successors, (215), 32 states have internal predecessors, (215), 0 states have call successors, (0), 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:52:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:23,339 INFO L225 Difference]: With dead ends: 17912 [2024-11-10 00:52:23,340 INFO L226 Difference]: Without dead ends: 14917 [2024-11-10 00:52:23,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=748, Invalid=3542, Unknown=0, NotChecked=0, Total=4290 [2024-11-10 00:52:23,352 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 28899 mSDsluCounter, 14023 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28899 SdHoareTripleChecker+Valid, 16250 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:23,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28899 Valid, 16250 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:52:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14917 states. [2024-11-10 00:52:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14917 to 14899. [2024-11-10 00:52:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14899 states, 14897 states have (on average 1.4618379539504598) internal successors, (21777), 14898 states have internal predecessors, (21777), 0 states have call successors, (0), 0 states have 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:52:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14899 states to 14899 states and 21777 transitions. [2024-11-10 00:52:23,791 INFO L78 Accepts]: Start accepts. Automaton has 14899 states and 21777 transitions. Word has length 79 [2024-11-10 00:52:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:23,792 INFO L471 AbstractCegarLoop]: Abstraction has 14899 states and 21777 transitions. [2024-11-10 00:52:23,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.71875) internal successors, (215), 32 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have 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:52:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 14899 states and 21777 transitions. [2024-11-10 00:52:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:52:23,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:23,795 INFO L215 NwaCegarLoop]: trace histogram [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:52:23,813 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 00:52:23,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:23,996 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:23,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:23,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1386621459, now seen corresponding path program 1 times [2024-11-10 00:52:23,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:23,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396737131] [2024-11-10 00:52:23,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:23,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:24,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396737131] [2024-11-10 00:52:24,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396737131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717505355] [2024-11-10 00:52:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:24,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:24,320 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 00:52:24,322 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 00:52:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:24,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 00:52:24,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:25,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:27,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717505355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:27,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:27,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 17] total 38 [2024-11-10 00:52:27,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855539661] [2024-11-10 00:52:27,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:27,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 00:52:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 00:52:27,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1244, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 00:52:27,951 INFO L87 Difference]: Start difference. First operand 14899 states and 21777 transitions. Second operand has 39 states, 39 states have (on average 5.282051282051282) internal successors, (206), 38 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have 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:52:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:31,094 INFO L93 Difference]: Finished difference Result 30137 states and 41315 transitions. [2024-11-10 00:52:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-10 00:52:31,095 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.282051282051282) internal successors, (206), 38 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:52:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:31,122 INFO L225 Difference]: With dead ends: 30137 [2024-11-10 00:52:31,122 INFO L226 Difference]: Without dead ends: 17550 [2024-11-10 00:52:31,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1559, Invalid=5581, Unknown=0, NotChecked=0, Total=7140 [2024-11-10 00:52:31,142 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 29422 mSDsluCounter, 20513 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29422 SdHoareTripleChecker+Valid, 22742 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:31,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29422 Valid, 22742 Invalid, 1496 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 00:52:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17550 states. [2024-11-10 00:52:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17550 to 15739. [2024-11-10 00:52:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15739 states, 15737 states have (on average 1.4439219673381203) internal successors, (22723), 15738 states have internal predecessors, (22723), 0 states have call successors, (0), 0 states have 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:52:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15739 states to 15739 states and 22723 transitions. [2024-11-10 00:52:31,591 INFO L78 Accepts]: Start accepts. Automaton has 15739 states and 22723 transitions. Word has length 80 [2024-11-10 00:52:31,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:31,592 INFO L471 AbstractCegarLoop]: Abstraction has 15739 states and 22723 transitions. [2024-11-10 00:52:31,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.282051282051282) internal successors, (206), 38 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have 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:52:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 15739 states and 22723 transitions. [2024-11-10 00:52:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:52:31,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:31,596 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:31,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:52:31,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:31,797 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:31,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 486489450, now seen corresponding path program 1 times [2024-11-10 00:52:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:31,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750790086] [2024-11-10 00:52:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:34,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:34,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750790086] [2024-11-10 00:52:34,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750790086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:34,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540469209] [2024-11-10 00:52:34,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:34,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:34,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:34,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:34,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:52:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:34,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-10 00:52:34,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:37,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:43,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540469209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:43,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:43,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 67 [2024-11-10 00:52:43,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502590888] [2024-11-10 00:52:43,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:43,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-10 00:52:43,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:43,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-10 00:52:43,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=4012, Unknown=0, NotChecked=0, Total=4422 [2024-11-10 00:52:43,581 INFO L87 Difference]: Start difference. First operand 15739 states and 22723 transitions. Second operand has 67 states, 67 states have (on average 3.328358208955224) internal successors, (223), 67 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)