./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c167e2ddaf8948d5e7bd26982f4dbc66059753c7303cdae96f611484751ca27 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:57:55,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:57:55,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:57:55,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:57:55,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:57:55,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:57:55,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:57:55,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:57:55,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:57:55,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:57:55,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:57:55,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:57:55,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:57:55,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:57:55,635 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:57:55,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:57:55,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:57:55,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:57:55,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:57:55,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:57:55,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:57:55,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:57:55,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:57:55,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:57:55,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:57:55,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:57:55,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:57:55,639 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:57:55,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:57:55,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:57:55,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:57:55,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:57:55,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:57:55,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:57:55,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:57:55,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:57:55,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:57:55,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:57:55,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:57:55,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:57:55,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:57:55,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:57:55,645 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 -> 2c167e2ddaf8948d5e7bd26982f4dbc66059753c7303cdae96f611484751ca27 [2024-11-10 00:57:55,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:57:55,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:57:55,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:57:55,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:57:55,971 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:57:55,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c [2024-11-10 00:57:57,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:57:57,878 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:57:57,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c [2024-11-10 00:57:57,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169e12776/2a4a631a90174ee697439c0ef54b4b55/FLAG1a5767221 [2024-11-10 00:57:58,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169e12776/2a4a631a90174ee697439c0ef54b4b55 [2024-11-10 00:57:58,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:57:58,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:57:58,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:57:58,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:57:58,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:57:58,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:57:58" (1/1) ... [2024-11-10 00:57:58,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a920cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:58, skipping insertion in model container [2024-11-10 00:57:58,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:57:58" (1/1) ... [2024-11-10 00:57:58,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:57:58,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c[15482,15495] [2024-11-10 00:57:58,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c[22418,22431] [2024-11-10 00:57:59,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:57:59,239 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:57:59,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c[15482,15495] [2024-11-10 00:57:59,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c[22418,22431] [2024-11-10 00:57:59,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:57:59,745 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:57:59,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59 WrapperNode [2024-11-10 00:57:59,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:57:59,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:57:59,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:57:59,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:57:59,754 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:57:59" (1/1) ... [2024-11-10 00:57:59,814 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:57:59" (1/1) ... [2024-11-10 00:58:00,193 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5157 [2024-11-10 00:58:00,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:58:00,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:58:00,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:58:00,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:58:00,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (1/1) ... [2024-11-10 00:58:00,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (1/1) ... [2024-11-10 00:58:00,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (1/1) ... [2024-11-10 00:58:00,541 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:58:00,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (1/1) ... [2024-11-10 00:58:00,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (1/1) ... [2024-11-10 00:58:00,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (1/1) ... [2024-11-10 00:58:00,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (1/1) ... [2024-11-10 00:58:00,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (1/1) ... [2024-11-10 00:58:00,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (1/1) ... [2024-11-10 00:58:00,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:58:00,925 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:58:00,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:58:00,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:58:00,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (1/1) ... [2024-11-10 00:58:00,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:58:00,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:00,960 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:58:00,963 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:58:01,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:58:01,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:58:01,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:58:01,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:58:01,141 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:58:01,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:58:06,450 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3683: havoc calculate_output2_#t~ret43#1; [2024-11-10 00:58:06,451 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5173: havoc calculate_output3_#t~ret44#1; [2024-11-10 00:58:06,451 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2204: havoc calculate_output_#t~ret42#1; [2024-11-10 00:58:06,761 INFO L? ?]: Removed 2086 outVars from TransFormulas that were not future-live. [2024-11-10 00:58:06,761 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:58:06,807 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:58:06,807 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:58:06,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:58:06 BoogieIcfgContainer [2024-11-10 00:58:06,809 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:58:06,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:58:06,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:58:06,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:58:06,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:57:58" (1/3) ... [2024-11-10 00:58:06,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ec462a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:58:06, skipping insertion in model container [2024-11-10 00:58:06,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:59" (2/3) ... [2024-11-10 00:58:06,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ec462a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:58:06, skipping insertion in model container [2024-11-10 00:58:06,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:58:06" (3/3) ... [2024-11-10 00:58:06,820 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c [2024-11-10 00:58:06,836 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:58:06,837 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:58:06,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:58:06,956 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;@5ceafcfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:58:06,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:58:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 921 states, 918 states have (on average 2.6383442265795205) internal successors, (2422), 920 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have 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:58:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 00:58:06,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:06,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:06,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:06,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1962490224, now seen corresponding path program 1 times [2024-11-10 00:58:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:06,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698216295] [2024-11-10 00:58:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:07,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:07,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698216295] [2024-11-10 00:58:07,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698216295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:07,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:07,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:58:07,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353954203] [2024-11-10 00:58:07,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:07,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:58:07,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:07,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:58:07,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:58:07,341 INFO L87 Difference]: Start difference. First operand has 921 states, 918 states have (on average 2.6383442265795205) internal successors, (2422), 920 states have internal predecessors, (2422), 0 states have call successors, (0), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:07,440 INFO L93 Difference]: Finished difference Result 1794 states and 4754 transitions. [2024-11-10 00:58:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:58:07,446 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 00:58:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:07,469 INFO L225 Difference]: With dead ends: 1794 [2024-11-10 00:58:07,469 INFO L226 Difference]: Without dead ends: 853 [2024-11-10 00:58:07,474 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:58:07,478 INFO L432 NwaCegarLoop]: 2354 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, 2354 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:58:07,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-10 00:58:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2024-11-10 00:58:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 2.6874265569917744) internal successors, (2287), 852 states have internal predecessors, (2287), 0 states have call successors, (0), 0 states have 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:58:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2287 transitions. [2024-11-10 00:58:07,560 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2287 transitions. Word has length 28 [2024-11-10 00:58:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:07,560 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 2287 transitions. [2024-11-10 00:58:07,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2287 transitions. [2024-11-10 00:58:07,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 00:58:07,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:07,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:07,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:58:07,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:07,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash -75566065, now seen corresponding path program 1 times [2024-11-10 00:58:07,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:07,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722229114] [2024-11-10 00:58:07,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:07,792 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:58:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:07,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722229114] [2024-11-10 00:58:07,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722229114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:58:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46325730] [2024-11-10 00:58:07,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:07,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:58:07,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:07,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:58:07,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:58:07,799 INFO L87 Difference]: Start difference. First operand 853 states and 2287 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:07,934 INFO L93 Difference]: Finished difference Result 908 states and 2371 transitions. [2024-11-10 00:58:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:58:07,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 00:58:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:07,940 INFO L225 Difference]: With dead ends: 908 [2024-11-10 00:58:07,941 INFO L226 Difference]: Without dead ends: 853 [2024-11-10 00:58:07,942 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:58:07,943 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 0 mSDsluCounter, 6810 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9095 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:07,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9095 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-10 00:58:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2024-11-10 00:58:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 2.6404230317273796) internal successors, (2247), 852 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have 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:58:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2247 transitions. [2024-11-10 00:58:07,979 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2247 transitions. Word has length 28 [2024-11-10 00:58:07,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:07,980 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 2247 transitions. [2024-11-10 00:58:07,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2247 transitions. [2024-11-10 00:58:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:58:07,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:07,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:07,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:58:07,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:07,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash -402374553, now seen corresponding path program 1 times [2024-11-10 00:58:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410636012] [2024-11-10 00:58:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:07,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:08,235 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:58:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410636012] [2024-11-10 00:58:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410636012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:08,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:08,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:08,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107917820] [2024-11-10 00:58:08,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:08,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:58:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:58:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:58:08,239 INFO L87 Difference]: Start difference. First operand 853 states and 2247 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:16,125 INFO L93 Difference]: Finished difference Result 3112 states and 8600 transitions. [2024-11-10 00:58:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:58:16,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:58:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:16,140 INFO L225 Difference]: With dead ends: 3112 [2024-11-10 00:58:16,141 INFO L226 Difference]: Without dead ends: 2357 [2024-11-10 00:58:16,143 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:58:16,146 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 4475 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8238 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4475 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 9338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 8238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:16,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4475 Valid, 844 Invalid, 9338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 8238 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-11-10 00:58:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2024-11-10 00:58:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2357. [2024-11-10 00:58:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2355 states have (on average 2.435244161358811) internal successors, (5735), 2356 states have internal predecessors, (5735), 0 states have call successors, (0), 0 states have 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:58:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 5735 transitions. [2024-11-10 00:58:16,227 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 5735 transitions. Word has length 62 [2024-11-10 00:58:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:16,227 INFO L471 AbstractCegarLoop]: Abstraction has 2357 states and 5735 transitions. [2024-11-10 00:58:16,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 5735 transitions. [2024-11-10 00:58:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:58:16,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:16,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:16,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:58:16,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:16,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:16,231 INFO L85 PathProgramCache]: Analyzing trace with hash 954186912, now seen corresponding path program 1 times [2024-11-10 00:58:16,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:16,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324856903] [2024-11-10 00:58:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:16,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:16,517 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:58:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324856903] [2024-11-10 00:58:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324856903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:16,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:16,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:16,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024029932] [2024-11-10 00:58:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:16,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:16,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:16,520 INFO L87 Difference]: Start difference. First operand 2357 states and 5735 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:16,812 INFO L93 Difference]: Finished difference Result 2969 states and 6695 transitions. [2024-11-10 00:58:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:58:16,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:58:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:16,826 INFO L225 Difference]: With dead ends: 2969 [2024-11-10 00:58:16,827 INFO L226 Difference]: Without dead ends: 2918 [2024-11-10 00:58:16,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:58:16,830 INFO L432 NwaCegarLoop]: 2243 mSDtfsCounter, 13829 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13829 SdHoareTripleChecker+Valid, 4341 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:16,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13829 Valid, 4341 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2024-11-10 00:58:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2405. [2024-11-10 00:58:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2403 states have (on average 2.418227215980025) internal successors, (5811), 2404 states have internal predecessors, (5811), 0 states have call successors, (0), 0 states have 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:58:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 5811 transitions. [2024-11-10 00:58:16,895 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 5811 transitions. Word has length 67 [2024-11-10 00:58:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:16,896 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 5811 transitions. [2024-11-10 00:58:16,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 5811 transitions. [2024-11-10 00:58:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:58:16,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:16,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:16,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:58:16,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:16,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:16,899 INFO L85 PathProgramCache]: Analyzing trace with hash 139981634, now seen corresponding path program 1 times [2024-11-10 00:58:16,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:16,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517266308] [2024-11-10 00:58:16,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:17,221 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:58:17,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:17,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517266308] [2024-11-10 00:58:17,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517266308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:17,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:17,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:17,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458950938] [2024-11-10 00:58:17,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:17,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:17,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:17,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:17,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:17,224 INFO L87 Difference]: Start difference. First operand 2405 states and 5811 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:17,473 INFO L93 Difference]: Finished difference Result 2507 states and 5969 transitions. [2024-11-10 00:58:17,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:17,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:58:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:17,485 INFO L225 Difference]: With dead ends: 2507 [2024-11-10 00:58:17,486 INFO L226 Difference]: Without dead ends: 2408 [2024-11-10 00:58:17,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:58:17,488 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 2216 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:17,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 2704 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2024-11-10 00:58:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2405. [2024-11-10 00:58:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2403 states have (on average 2.4178110694964627) internal successors, (5810), 2404 states have internal predecessors, (5810), 0 states have call successors, (0), 0 states have 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:58:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 5810 transitions. [2024-11-10 00:58:17,547 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 5810 transitions. Word has length 69 [2024-11-10 00:58:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:17,547 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 5810 transitions. [2024-11-10 00:58:17,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 5810 transitions. [2024-11-10 00:58:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 00:58:17,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:17,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:17,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:58:17,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:17,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:17,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1768282563, now seen corresponding path program 1 times [2024-11-10 00:58:17,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:17,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627965934] [2024-11-10 00:58:17,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:17,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:17,618 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:58:17,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:17,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627965934] [2024-11-10 00:58:17,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627965934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:17,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:17,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:17,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674796719] [2024-11-10 00:58:17,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:17,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:17,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:17,622 INFO L87 Difference]: Start difference. First operand 2405 states and 5810 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:17,660 INFO L93 Difference]: Finished difference Result 2591 states and 6100 transitions. [2024-11-10 00:58:17,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:17,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-10 00:58:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:17,672 INFO L225 Difference]: With dead ends: 2591 [2024-11-10 00:58:17,673 INFO L226 Difference]: Without dead ends: 2492 [2024-11-10 00:58:17,674 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:58:17,674 INFO L432 NwaCegarLoop]: 2253 mSDtfsCounter, 2174 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:17,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 2328 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2024-11-10 00:58:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2489. [2024-11-10 00:58:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2487 states have (on average 2.388419782870929) internal successors, (5940), 2488 states have internal predecessors, (5940), 0 states have call successors, (0), 0 states have 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:58:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 5940 transitions. [2024-11-10 00:58:17,730 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 5940 transitions. Word has length 70 [2024-11-10 00:58:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:17,731 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 5940 transitions. [2024-11-10 00:58:17,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 5940 transitions. [2024-11-10 00:58:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:17,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:17,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:17,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:58:17,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:17,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash 195638852, now seen corresponding path program 1 times [2024-11-10 00:58:17,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:17,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57676824] [2024-11-10 00:58:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:17,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:17,815 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:58:17,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57676824] [2024-11-10 00:58:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57676824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:17,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:17,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:17,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008018185] [2024-11-10 00:58:17,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:17,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:17,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:17,818 INFO L87 Difference]: Start difference. First operand 2489 states and 5940 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:58:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:17,860 INFO L93 Difference]: Finished difference Result 2682 states and 6240 transitions. [2024-11-10 00:58:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:17,860 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:58:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:17,872 INFO L225 Difference]: With dead ends: 2682 [2024-11-10 00:58:17,872 INFO L226 Difference]: Without dead ends: 2583 [2024-11-10 00:58:17,875 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:58:17,876 INFO L432 NwaCegarLoop]: 2311 mSDtfsCounter, 2190 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2392 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:58:17,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2392 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2024-11-10 00:58:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2580. [2024-11-10 00:58:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2580 states, 2578 states have (on average 2.3584173778122577) internal successors, (6080), 2579 states have internal predecessors, (6080), 0 states have call successors, (0), 0 states have 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:58:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 6080 transitions. [2024-11-10 00:58:17,935 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 6080 transitions. Word has length 71 [2024-11-10 00:58:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:17,935 INFO L471 AbstractCegarLoop]: Abstraction has 2580 states and 6080 transitions. [2024-11-10 00:58:17,935 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:58:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 6080 transitions. [2024-11-10 00:58:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:17,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:17,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:17,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:58:17,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:17,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:17,937 INFO L85 PathProgramCache]: Analyzing trace with hash -576901948, now seen corresponding path program 1 times [2024-11-10 00:58:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149534837] [2024-11-10 00:58:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:17,998 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:58:17,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149534837] [2024-11-10 00:58:17,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149534837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:17,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:17,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:17,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535853339] [2024-11-10 00:58:18,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:18,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:18,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:18,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:18,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:18,001 INFO L87 Difference]: Start difference. First operand 2580 states and 6080 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:58:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:18,040 INFO L93 Difference]: Finished difference Result 3098 states and 6882 transitions. [2024-11-10 00:58:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:18,041 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:58:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:18,053 INFO L225 Difference]: With dead ends: 3098 [2024-11-10 00:58:18,053 INFO L226 Difference]: Without dead ends: 2827 [2024-11-10 00:58:18,055 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:58:18,056 INFO L432 NwaCegarLoop]: 2303 mSDtfsCounter, 2186 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2186 SdHoareTripleChecker+Valid, 2392 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:58:18,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2186 Valid, 2392 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2024-11-10 00:58:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2824. [2024-11-10 00:58:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2824 states, 2822 states have (on average 2.28632175761871) internal successors, (6452), 2823 states have internal predecessors, (6452), 0 states have call successors, (0), 0 states have 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:58:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 6452 transitions. [2024-11-10 00:58:18,127 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 6452 transitions. Word has length 71 [2024-11-10 00:58:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:18,127 INFO L471 AbstractCegarLoop]: Abstraction has 2824 states and 6452 transitions. [2024-11-10 00:58:18,128 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:58:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 6452 transitions. [2024-11-10 00:58:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:18,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:18,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:18,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:58:18,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:18,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1578311676, now seen corresponding path program 1 times [2024-11-10 00:58:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790342961] [2024-11-10 00:58:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:18,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:18,260 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:58:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790342961] [2024-11-10 00:58:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790342961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:18,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:18,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386550431] [2024-11-10 00:58:18,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:18,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:18,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:18,262 INFO L87 Difference]: Start difference. First operand 2824 states and 6452 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:58:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:18,308 INFO L93 Difference]: Finished difference Result 3806 states and 7956 transitions. [2024-11-10 00:58:18,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:18,309 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:58:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:18,322 INFO L225 Difference]: With dead ends: 3806 [2024-11-10 00:58:18,323 INFO L226 Difference]: Without dead ends: 3291 [2024-11-10 00:58:18,325 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:58:18,326 INFO L432 NwaCegarLoop]: 2301 mSDtfsCounter, 2184 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 2394 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:58:18,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 2394 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2024-11-10 00:58:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 3288. [2024-11-10 00:58:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3286 states have (on average 2.175289105295192) internal successors, (7148), 3287 states have internal predecessors, (7148), 0 states have call successors, (0), 0 states have 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:58:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 7148 transitions. [2024-11-10 00:58:18,402 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 7148 transitions. Word has length 71 [2024-11-10 00:58:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:18,403 INFO L471 AbstractCegarLoop]: Abstraction has 3288 states and 7148 transitions. [2024-11-10 00:58:18,403 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:58:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 7148 transitions. [2024-11-10 00:58:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:18,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:18,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:18,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:58:18,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:18,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1592761532, now seen corresponding path program 1 times [2024-11-10 00:58:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545300719] [2024-11-10 00:58:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:18,475 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:58:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545300719] [2024-11-10 00:58:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545300719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:18,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:18,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575199370] [2024-11-10 00:58:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:18,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:18,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:18,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:18,481 INFO L87 Difference]: Start difference. First operand 3288 states and 7148 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:58:18,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:18,538 INFO L93 Difference]: Finished difference Result 5150 states and 9960 transitions. [2024-11-10 00:58:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:18,538 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:58:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:18,561 INFO L225 Difference]: With dead ends: 5150 [2024-11-10 00:58:18,562 INFO L226 Difference]: Without dead ends: 4171 [2024-11-10 00:58:18,565 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:58:18,566 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 2182 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 2396 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:58:18,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 2396 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2024-11-10 00:58:18,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4168. [2024-11-10 00:58:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 4166 states have (on average 2.0268843014882383) internal successors, (8444), 4167 states have internal predecessors, (8444), 0 states have call successors, (0), 0 states have 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:58:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 8444 transitions. [2024-11-10 00:58:18,664 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 8444 transitions. Word has length 71 [2024-11-10 00:58:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 4168 states and 8444 transitions. [2024-11-10 00:58:18,665 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:58:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 8444 transitions. [2024-11-10 00:58:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:18,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:18,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:18,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:58:18,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:18,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash 498841220, now seen corresponding path program 1 times [2024-11-10 00:58:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:18,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732838444] [2024-11-10 00:58:18,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:18,727 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:58:18,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:18,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732838444] [2024-11-10 00:58:18,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732838444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:18,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:18,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:18,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882307347] [2024-11-10 00:58:18,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:18,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:18,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:18,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:18,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:18,729 INFO L87 Difference]: Start difference. First operand 4168 states and 8444 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:58:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:18,815 INFO L93 Difference]: Finished difference Result 7694 states and 13680 transitions. [2024-11-10 00:58:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:18,816 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:58:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:18,832 INFO L225 Difference]: With dead ends: 7694 [2024-11-10 00:58:18,832 INFO L226 Difference]: Without dead ends: 5835 [2024-11-10 00:58:18,836 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:58:18,837 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 2180 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:18,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2398 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2024-11-10 00:58:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5832. [2024-11-10 00:58:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5832 states, 5830 states have (on average 1.8600343053173243) internal successors, (10844), 5831 states have internal predecessors, (10844), 0 states have call successors, (0), 0 states have 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:58:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5832 states to 5832 states and 10844 transitions. [2024-11-10 00:58:18,981 INFO L78 Accepts]: Start accepts. Automaton has 5832 states and 10844 transitions. Word has length 71 [2024-11-10 00:58:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:18,981 INFO L471 AbstractCegarLoop]: Abstraction has 5832 states and 10844 transitions. [2024-11-10 00:58:18,982 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:58:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5832 states and 10844 transitions. [2024-11-10 00:58:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:18,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:18,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:18,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:58:18,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:18,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:18,983 INFO L85 PathProgramCache]: Analyzing trace with hash -25435835, now seen corresponding path program 1 times [2024-11-10 00:58:18,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:18,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603884013] [2024-11-10 00:58:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:18,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:19,252 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:58:19,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603884013] [2024-11-10 00:58:19,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603884013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:19,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:19,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75704714] [2024-11-10 00:58:19,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:19,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:19,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:19,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:19,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:19,254 INFO L87 Difference]: Start difference. First operand 5832 states and 10844 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:19,438 INFO L93 Difference]: Finished difference Result 6027 states and 11102 transitions. [2024-11-10 00:58:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:19,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:58:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:19,451 INFO L225 Difference]: With dead ends: 6027 [2024-11-10 00:58:19,452 INFO L226 Difference]: Without dead ends: 6024 [2024-11-10 00:58:19,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:19,454 INFO L432 NwaCegarLoop]: 2241 mSDtfsCounter, 0 mSDsluCounter, 13433 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15674 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:19,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15674 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2024-11-10 00:58:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 6024. [2024-11-10 00:58:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6024 states, 6022 states have (on average 1.8299568249750913) internal successors, (11020), 6023 states have internal predecessors, (11020), 0 states have call successors, (0), 0 states have 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:58:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6024 states to 6024 states and 11020 transitions. [2024-11-10 00:58:19,627 INFO L78 Accepts]: Start accepts. Automaton has 6024 states and 11020 transitions. Word has length 71 [2024-11-10 00:58:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:19,628 INFO L471 AbstractCegarLoop]: Abstraction has 6024 states and 11020 transitions. [2024-11-10 00:58:19,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:19,628 INFO L276 IsEmpty]: Start isEmpty. Operand 6024 states and 11020 transitions. [2024-11-10 00:58:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:19,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:19,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:19,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:58:19,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:19,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:19,630 INFO L85 PathProgramCache]: Analyzing trace with hash -294827644, now seen corresponding path program 1 times [2024-11-10 00:58:19,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:19,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347392145] [2024-11-10 00:58:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:19,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:19,701 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:58:19,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:19,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347392145] [2024-11-10 00:58:19,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347392145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:19,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757697881] [2024-11-10 00:58:19,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:19,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:19,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:19,703 INFO L87 Difference]: Start difference. First operand 6024 states and 11020 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:58:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:19,884 INFO L93 Difference]: Finished difference Result 13070 states and 21072 transitions. [2024-11-10 00:58:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:19,885 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:58:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:19,905 INFO L225 Difference]: With dead ends: 13070 [2024-11-10 00:58:19,905 INFO L226 Difference]: Without dead ends: 9355 [2024-11-10 00:58:19,913 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:58:19,914 INFO L432 NwaCegarLoop]: 2313 mSDtfsCounter, 2188 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:19,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2188 Valid, 2398 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2024-11-10 00:58:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 9352. [2024-11-10 00:58:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9352 states, 9350 states have (on average 1.6697326203208556) internal successors, (15612), 9351 states have internal predecessors, (15612), 0 states have call successors, (0), 0 states have 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:58:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9352 states to 9352 states and 15612 transitions. [2024-11-10 00:58:20,192 INFO L78 Accepts]: Start accepts. Automaton has 9352 states and 15612 transitions. Word has length 71 [2024-11-10 00:58:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:20,192 INFO L471 AbstractCegarLoop]: Abstraction has 9352 states and 15612 transitions. [2024-11-10 00:58:20,192 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:58:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 9352 states and 15612 transitions. [2024-11-10 00:58:20,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:20,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:20,196 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:20,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:58:20,197 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:20,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash 674170550, now seen corresponding path program 1 times [2024-11-10 00:58:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:20,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977927830] [2024-11-10 00:58:20,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:20,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:58:20,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:20,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977927830] [2024-11-10 00:58:20,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977927830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:20,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:20,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:20,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688024086] [2024-11-10 00:58:20,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:20,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:20,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:20,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:20,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:20,407 INFO L87 Difference]: Start difference. First operand 9352 states and 15612 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:58:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:21,178 INFO L93 Difference]: Finished difference Result 51069 states and 74506 transitions. [2024-11-10 00:58:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:21,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:21,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:21,259 INFO L225 Difference]: With dead ends: 51069 [2024-11-10 00:58:21,259 INFO L226 Difference]: Without dead ends: 46074 [2024-11-10 00:58:21,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:21,287 INFO L432 NwaCegarLoop]: 2324 mSDtfsCounter, 11454 mSDsluCounter, 3062 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11454 SdHoareTripleChecker+Valid, 5386 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:21,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11454 Valid, 5386 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46074 states. [2024-11-10 00:58:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46074 to 15400. [2024-11-10 00:58:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15400 states, 15398 states have (on average 1.5625405896869724) internal successors, (24060), 15399 states have internal predecessors, (24060), 0 states have call successors, (0), 0 states have 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:58:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15400 states to 15400 states and 24060 transitions. [2024-11-10 00:58:21,993 INFO L78 Accepts]: Start accepts. Automaton has 15400 states and 24060 transitions. Word has length 94 [2024-11-10 00:58:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:21,993 INFO L471 AbstractCegarLoop]: Abstraction has 15400 states and 24060 transitions. [2024-11-10 00:58:21,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:58:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 15400 states and 24060 transitions. [2024-11-10 00:58:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:21,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:21,998 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:21,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:58:21,998 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:21,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash -98370250, now seen corresponding path program 1 times [2024-11-10 00:58:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:21,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433796070] [2024-11-10 00:58:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:21,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:58:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433796070] [2024-11-10 00:58:22,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433796070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:22,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:22,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:22,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515702580] [2024-11-10 00:58:22,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:22,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:22,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:22,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:22,201 INFO L87 Difference]: Start difference. First operand 15400 states and 24060 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:23,119 INFO L93 Difference]: Finished difference Result 58109 states and 84394 transitions. [2024-11-10 00:58:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:23,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:23,275 INFO L225 Difference]: With dead ends: 58109 [2024-11-10 00:58:23,276 INFO L226 Difference]: Without dead ends: 51066 [2024-11-10 00:58:23,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:23,315 INFO L432 NwaCegarLoop]: 2326 mSDtfsCounter, 11515 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11515 SdHoareTripleChecker+Valid, 5394 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:23,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11515 Valid, 5394 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51066 states. [2024-11-10 00:58:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51066 to 24936. [2024-11-10 00:58:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24936 states, 24934 states have (on average 1.4988369294938637) internal successors, (37372), 24935 states have internal predecessors, (37372), 0 states have call successors, (0), 0 states have 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:58:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24936 states to 24936 states and 37372 transitions. [2024-11-10 00:58:24,178 INFO L78 Accepts]: Start accepts. Automaton has 24936 states and 37372 transitions. Word has length 94 [2024-11-10 00:58:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:24,178 INFO L471 AbstractCegarLoop]: Abstraction has 24936 states and 37372 transitions. [2024-11-10 00:58:24,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 24936 states and 37372 transitions. [2024-11-10 00:58:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:24,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:24,185 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:24,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:58:24,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:24,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1099779978, now seen corresponding path program 1 times [2024-11-10 00:58:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73941273] [2024-11-10 00:58:24,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:58:24,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:24,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73941273] [2024-11-10 00:58:24,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73941273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:24,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086299157] [2024-11-10 00:58:24,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:24,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:24,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:24,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:24,445 INFO L87 Difference]: Start difference. First operand 24936 states and 37372 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:25,712 INFO L93 Difference]: Finished difference Result 65149 states and 94250 transitions. [2024-11-10 00:58:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:25,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:25,814 INFO L225 Difference]: With dead ends: 65149 [2024-11-10 00:58:25,815 INFO L226 Difference]: Without dead ends: 58106 [2024-11-10 00:58:25,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:25,845 INFO L432 NwaCegarLoop]: 2323 mSDtfsCounter, 11561 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11561 SdHoareTripleChecker+Valid, 5343 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:25,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11561 Valid, 5343 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58106 states. [2024-11-10 00:58:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58106 to 31976. [2024-11-10 00:58:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31976 states, 31974 states have (on average 1.4770751235378745) internal successors, (47228), 31975 states have internal predecessors, (47228), 0 states have call successors, (0), 0 states have 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:58:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 47228 transitions. [2024-11-10 00:58:26,975 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 47228 transitions. Word has length 94 [2024-11-10 00:58:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:26,975 INFO L471 AbstractCegarLoop]: Abstraction has 31976 states and 47228 transitions. [2024-11-10 00:58:26,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 47228 transitions. [2024-11-10 00:58:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:26,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:26,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:26,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:58:26,980 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:26,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1114229834, now seen corresponding path program 1 times [2024-11-10 00:58:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:26,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003954833] [2024-11-10 00:58:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:26,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:58:27,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:27,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003954833] [2024-11-10 00:58:27,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003954833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:27,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:27,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:27,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003141731] [2024-11-10 00:58:27,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:27,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:27,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:27,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:27,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:27,247 INFO L87 Difference]: Start difference. First operand 31976 states and 47228 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:28,798 INFO L93 Difference]: Finished difference Result 72189 states and 104106 transitions. [2024-11-10 00:58:28,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:28,886 INFO L225 Difference]: With dead ends: 72189 [2024-11-10 00:58:28,886 INFO L226 Difference]: Without dead ends: 65146 [2024-11-10 00:58:28,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:28,906 INFO L432 NwaCegarLoop]: 2320 mSDtfsCounter, 11610 mSDsluCounter, 3023 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11610 SdHoareTripleChecker+Valid, 5343 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:28,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11610 Valid, 5343 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65146 states. [2024-11-10 00:58:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65146 to 39016. [2024-11-10 00:58:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39016 states, 39014 states have (on average 1.4631670682319167) internal successors, (57084), 39015 states have internal predecessors, (57084), 0 states have call successors, (0), 0 states have 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:58:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39016 states to 39016 states and 57084 transitions. [2024-11-10 00:58:30,199 INFO L78 Accepts]: Start accepts. Automaton has 39016 states and 57084 transitions. Word has length 94 [2024-11-10 00:58:30,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:30,200 INFO L471 AbstractCegarLoop]: Abstraction has 39016 states and 57084 transitions. [2024-11-10 00:58:30,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 39016 states and 57084 transitions. [2024-11-10 00:58:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:30,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:30,207 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:30,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:58:30,208 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:30,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash 977372918, now seen corresponding path program 1 times [2024-11-10 00:58:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:30,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148161534] [2024-11-10 00:58:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 00:58:30,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:30,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148161534] [2024-11-10 00:58:30,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148161534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:30,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:30,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:30,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893284414] [2024-11-10 00:58:30,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:30,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:30,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:30,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:30,441 INFO L87 Difference]: Start difference. First operand 39016 states and 57084 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:32,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:32,261 INFO L93 Difference]: Finished difference Result 79229 states and 113962 transitions. [2024-11-10 00:58:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:32,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:32,370 INFO L225 Difference]: With dead ends: 79229 [2024-11-10 00:58:32,370 INFO L226 Difference]: Without dead ends: 72186 [2024-11-10 00:58:32,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:32,393 INFO L432 NwaCegarLoop]: 2320 mSDtfsCounter, 11522 mSDsluCounter, 3103 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11522 SdHoareTripleChecker+Valid, 5423 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:32,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11522 Valid, 5423 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72186 states. [2024-11-10 00:58:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72186 to 46056. [2024-11-10 00:58:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46056 states, 46054 states have (on average 1.4535110956703001) internal successors, (66940), 46055 states have internal predecessors, (66940), 0 states have call successors, (0), 0 states have 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:58:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46056 states to 46056 states and 66940 transitions. [2024-11-10 00:58:33,734 INFO L78 Accepts]: Start accepts. Automaton has 46056 states and 66940 transitions. Word has length 94 [2024-11-10 00:58:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:33,735 INFO L471 AbstractCegarLoop]: Abstraction has 46056 states and 66940 transitions. [2024-11-10 00:58:33,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 46056 states and 66940 transitions. [2024-11-10 00:58:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:33,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:33,742 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:33,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:58:33,742 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:33,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash 183704054, now seen corresponding path program 1 times [2024-11-10 00:58:33,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:33,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431183561] [2024-11-10 00:58:33,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:58:33,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431183561] [2024-11-10 00:58:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431183561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:33,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:33,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:33,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248957234] [2024-11-10 00:58:33,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:33,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:33,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:33,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:33,915 INFO L87 Difference]: Start difference. First operand 46056 states and 66940 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:36,147 INFO L93 Difference]: Finished difference Result 86269 states and 123818 transitions. [2024-11-10 00:58:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:36,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:36,244 INFO L225 Difference]: With dead ends: 86269 [2024-11-10 00:58:36,244 INFO L226 Difference]: Without dead ends: 79226 [2024-11-10 00:58:36,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:36,262 INFO L432 NwaCegarLoop]: 2321 mSDtfsCounter, 11462 mSDsluCounter, 3241 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11462 SdHoareTripleChecker+Valid, 5562 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:36,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11462 Valid, 5562 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79226 states. [2024-11-10 00:58:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79226 to 53096. [2024-11-10 00:58:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53096 states, 53094 states have (on average 1.446415790861491) internal successors, (76796), 53095 states have internal predecessors, (76796), 0 states have call successors, (0), 0 states have 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:58:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53096 states to 53096 states and 76796 transitions. [2024-11-10 00:58:37,871 INFO L78 Accepts]: Start accepts. Automaton has 53096 states and 76796 transitions. Word has length 94 [2024-11-10 00:58:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:37,871 INFO L471 AbstractCegarLoop]: Abstraction has 53096 states and 76796 transitions. [2024-11-10 00:58:37,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 53096 states and 76796 transitions. [2024-11-10 00:58:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:58:37,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:37,878 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:37,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:58:37,878 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:37,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1627197400, now seen corresponding path program 1 times [2024-11-10 00:58:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831339064] [2024-11-10 00:58:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831339064] [2024-11-10 00:58:37,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831339064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:37,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:37,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:37,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87068187] [2024-11-10 00:58:37,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:38,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:38,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:38,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:38,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:38,000 INFO L87 Difference]: Start difference. First operand 53096 states and 76796 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:39,662 INFO L93 Difference]: Finished difference Result 103886 states and 147936 transitions. [2024-11-10 00:58:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:39,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-10 00:58:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:39,745 INFO L225 Difference]: With dead ends: 103886 [2024-11-10 00:58:39,745 INFO L226 Difference]: Without dead ends: 53099 [2024-11-10 00:58:39,784 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:58:39,784 INFO L432 NwaCegarLoop]: 2291 mSDtfsCounter, 52 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4526 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:58:39,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4526 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53099 states. [2024-11-10 00:58:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53099 to 53096. [2024-11-10 00:58:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53096 states, 53094 states have (on average 1.4334576411647266) internal successors, (76108), 53095 states have internal predecessors, (76108), 0 states have call successors, (0), 0 states have 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:58:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53096 states to 53096 states and 76108 transitions. [2024-11-10 00:58:41,427 INFO L78 Accepts]: Start accepts. Automaton has 53096 states and 76108 transitions. Word has length 96 [2024-11-10 00:58:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:41,428 INFO L471 AbstractCegarLoop]: Abstraction has 53096 states and 76108 transitions. [2024-11-10 00:58:41,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 53096 states and 76108 transitions. [2024-11-10 00:58:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:58:41,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:41,433 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:41,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:58:41,433 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:41,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1559669992, now seen corresponding path program 1 times [2024-11-10 00:58:41,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:41,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576806859] [2024-11-10 00:58:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:41,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:41,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576806859] [2024-11-10 00:58:41,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576806859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:41,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:41,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:41,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205324022] [2024-11-10 00:58:41,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:41,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:41,547 INFO L87 Difference]: Start difference. First operand 53096 states and 76108 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:42,149 INFO L93 Difference]: Finished difference Result 71845 states and 102296 transitions. [2024-11-10 00:58:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-10 00:58:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:42,184 INFO L225 Difference]: With dead ends: 71845 [2024-11-10 00:58:42,185 INFO L226 Difference]: Without dead ends: 21058 [2024-11-10 00:58:42,207 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:58:42,208 INFO L432 NwaCegarLoop]: 2289 mSDtfsCounter, 48 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4523 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:42,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4523 Invalid, 5 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21058 states. [2024-11-10 00:58:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21058 to 21048. [2024-11-10 00:58:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21048 states, 21046 states have (on average 1.5012829041147961) internal successors, (31596), 21047 states have internal predecessors, (31596), 0 states have call successors, (0), 0 states have 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:58:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21048 states to 21048 states and 31596 transitions. [2024-11-10 00:58:42,869 INFO L78 Accepts]: Start accepts. Automaton has 21048 states and 31596 transitions. Word has length 96 [2024-11-10 00:58:42,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:42,869 INFO L471 AbstractCegarLoop]: Abstraction has 21048 states and 31596 transitions. [2024-11-10 00:58:42,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21048 states and 31596 transitions. [2024-11-10 00:58:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:58:42,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:42,872 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:42,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:58:42,873 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:42,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1304586086, now seen corresponding path program 1 times [2024-11-10 00:58:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:42,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319708878] [2024-11-10 00:58:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:43,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:43,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319708878] [2024-11-10 00:58:43,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319708878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:43,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:43,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418920189] [2024-11-10 00:58:43,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:43,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:43,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:43,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:43,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:43,108 INFO L87 Difference]: Start difference. First operand 21048 states and 31596 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:43,364 INFO L93 Difference]: Finished difference Result 30414 states and 44560 transitions. [2024-11-10 00:58:43,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:43,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-10 00:58:43,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:43,380 INFO L225 Difference]: With dead ends: 30414 [2024-11-10 00:58:43,380 INFO L226 Difference]: Without dead ends: 11691 [2024-11-10 00:58:43,394 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:58:43,394 INFO L432 NwaCegarLoop]: 2283 mSDtfsCounter, 46 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 4502 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:58:43,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 4502 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11691 states. [2024-11-10 00:58:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11691 to 11688. [2024-11-10 00:58:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11688 states, 11686 states have (on average 1.5844600376518911) internal successors, (18516), 11687 states have internal predecessors, (18516), 0 states have call successors, (0), 0 states have 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:58:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11688 states to 11688 states and 18516 transitions. [2024-11-10 00:58:43,628 INFO L78 Accepts]: Start accepts. Automaton has 11688 states and 18516 transitions. Word has length 98 [2024-11-10 00:58:43,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:43,629 INFO L471 AbstractCegarLoop]: Abstraction has 11688 states and 18516 transitions. [2024-11-10 00:58:43,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 11688 states and 18516 transitions. [2024-11-10 00:58:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:58:43,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:43,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:43,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:58:43,632 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:43,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash 687095265, now seen corresponding path program 1 times [2024-11-10 00:58:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:43,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509659381] [2024-11-10 00:58:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:43,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:43,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:43,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509659381] [2024-11-10 00:58:43,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509659381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:43,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:43,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:43,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225593656] [2024-11-10 00:58:43,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:43,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:43,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:43,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:43,798 INFO L87 Difference]: Start difference. First operand 11688 states and 18516 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:43,987 INFO L93 Difference]: Finished difference Result 16374 states and 24940 transitions. [2024-11-10 00:58:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:43,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-10 00:58:43,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:44,002 INFO L225 Difference]: With dead ends: 16374 [2024-11-10 00:58:44,002 INFO L226 Difference]: Without dead ends: 7011 [2024-11-10 00:58:44,011 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:58:44,011 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 43 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4487 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:58:44,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4487 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7011 states. [2024-11-10 00:58:44,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7011 to 7008. [2024-11-10 00:58:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7008 states, 7006 states have (on average 1.717956037681987) internal successors, (12036), 7007 states have internal predecessors, (12036), 0 states have call successors, (0), 0 states have 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:58:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7008 states to 7008 states and 12036 transitions. [2024-11-10 00:58:44,189 INFO L78 Accepts]: Start accepts. Automaton has 7008 states and 12036 transitions. Word has length 100 [2024-11-10 00:58:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:44,190 INFO L471 AbstractCegarLoop]: Abstraction has 7008 states and 12036 transitions. [2024-11-10 00:58:44,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7008 states and 12036 transitions. [2024-11-10 00:58:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 00:58:44,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:44,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:44,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:58:44,192 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:44,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1321194568, now seen corresponding path program 1 times [2024-11-10 00:58:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635296215] [2024-11-10 00:58:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:44,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:44,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635296215] [2024-11-10 00:58:44,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635296215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:44,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:44,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:44,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483479113] [2024-11-10 00:58:44,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:44,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:44,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:44,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:44,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:44,282 INFO L87 Difference]: Start difference. First operand 7008 states and 12036 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:44,366 INFO L93 Difference]: Finished difference Result 9354 states and 15220 transitions. [2024-11-10 00:58:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:44,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-10 00:58:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:44,376 INFO L225 Difference]: With dead ends: 9354 [2024-11-10 00:58:44,376 INFO L226 Difference]: Without dead ends: 4671 [2024-11-10 00:58:44,380 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:58:44,381 INFO L432 NwaCegarLoop]: 2269 mSDtfsCounter, 40 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4472 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:58:44,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4472 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2024-11-10 00:58:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4668. [2024-11-10 00:58:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4668 states, 4666 states have (on average 1.891555936562366) internal successors, (8826), 4667 states have internal predecessors, (8826), 0 states have call successors, (0), 0 states have 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:58:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4668 states to 4668 states and 8826 transitions. [2024-11-10 00:58:44,487 INFO L78 Accepts]: Start accepts. Automaton has 4668 states and 8826 transitions. Word has length 102 [2024-11-10 00:58:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:44,487 INFO L471 AbstractCegarLoop]: Abstraction has 4668 states and 8826 transitions. [2024-11-10 00:58:44,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4668 states and 8826 transitions. [2024-11-10 00:58:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 00:58:44,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:44,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:44,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 00:58:44,490 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:44,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash 503630799, now seen corresponding path program 1 times [2024-11-10 00:58:44,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:44,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268811803] [2024-11-10 00:58:44,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:44,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268811803] [2024-11-10 00:58:44,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268811803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:44,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:44,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74273212] [2024-11-10 00:58:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:44,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:44,634 INFO L87 Difference]: Start difference. First operand 4668 states and 8826 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:44,693 INFO L93 Difference]: Finished difference Result 5844 states and 10405 transitions. [2024-11-10 00:58:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:44,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-10 00:58:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:44,701 INFO L225 Difference]: With dead ends: 5844 [2024-11-10 00:58:44,701 INFO L226 Difference]: Without dead ends: 3501 [2024-11-10 00:58:44,704 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:58:44,705 INFO L432 NwaCegarLoop]: 2262 mSDtfsCounter, 37 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4457 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:58:44,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4457 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2024-11-10 00:58:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3498. [2024-11-10 00:58:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3496 states have (on average 2.0697940503432495) internal successors, (7236), 3497 states have internal predecessors, (7236), 0 states have call successors, (0), 0 states have 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:58:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 7236 transitions. [2024-11-10 00:58:44,824 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 7236 transitions. Word has length 104 [2024-11-10 00:58:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:44,824 INFO L471 AbstractCegarLoop]: Abstraction has 3498 states and 7236 transitions. [2024-11-10 00:58:44,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 7236 transitions. [2024-11-10 00:58:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 00:58:44,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:44,825 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:44,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 00:58:44,826 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:44,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1015442314, now seen corresponding path program 1 times [2024-11-10 00:58:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449449180] [2024-11-10 00:58:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:45,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449449180] [2024-11-10 00:58:45,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449449180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:58:45,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378827177] [2024-11-10 00:58:45,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:45,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:58:45,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:45,273 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:58:45,274 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:58:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:45,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:58:45,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:58:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:46,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:58:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378827177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:58:47,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:58:47,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 00:58:47,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938599661] [2024-11-10 00:58:47,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:58:47,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 00:58:47,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:47,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 00:58:47,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:58:47,511 INFO L87 Difference]: Start difference. First operand 3498 states and 7236 transitions. Second operand has 25 states, 25 states have (on average 11.68) internal successors, (292), 24 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:49,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:49,158 INFO L93 Difference]: Finished difference Result 8499 states and 13910 transitions. [2024-11-10 00:58:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 00:58:49,159 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.68) internal successors, (292), 24 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-11-10 00:58:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:49,174 INFO L225 Difference]: With dead ends: 8499 [2024-11-10 00:58:49,175 INFO L226 Difference]: Without dead ends: 7326 [2024-11-10 00:58:49,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=611, Invalid=2469, Unknown=0, NotChecked=0, Total=3080 [2024-11-10 00:58:49,181 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 25193 mSDsluCounter, 11662 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25193 SdHoareTripleChecker+Valid, 13875 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:49,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25193 Valid, 13875 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:58:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7326 states. [2024-11-10 00:58:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7326 to 7248. [2024-11-10 00:58:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7248 states, 7246 states have (on average 1.6693348054098813) internal successors, (12096), 7247 states have internal predecessors, (12096), 0 states have call successors, (0), 0 states have 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:58:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 12096 transitions. [2024-11-10 00:58:49,335 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 12096 transitions. Word has length 106 [2024-11-10 00:58:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:49,336 INFO L471 AbstractCegarLoop]: Abstraction has 7248 states and 12096 transitions. [2024-11-10 00:58:49,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.68) internal successors, (292), 24 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 12096 transitions. [2024-11-10 00:58:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 00:58:49,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:49,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:49,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:58:49,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 00:58:49,539 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:49,540 INFO L85 PathProgramCache]: Analyzing trace with hash -261752906, now seen corresponding path program 1 times [2024-11-10 00:58:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:49,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854188098] [2024-11-10 00:58:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:50,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:50,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854188098] [2024-11-10 00:58:50,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854188098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:58:50,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462712109] [2024-11-10 00:58:50,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:50,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:58:50,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:50,485 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:58:50,486 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:58:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:50,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:58:50,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:58:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:51,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:58:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:51,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462712109] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:58:51,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:58:51,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-11-10 00:58:51,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457108745] [2024-11-10 00:58:51,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:58:51,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 00:58:51,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:51,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 00:58:51,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:58:51,922 INFO L87 Difference]: Start difference. First operand 7248 states and 12096 transitions. Second operand has 28 states, 28 states have (on average 10.0) internal successors, (280), 27 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have 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:58:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:54,763 INFO L93 Difference]: Finished difference Result 31989 states and 44750 transitions. [2024-11-10 00:58:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-10 00:58:54,763 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.0) internal successors, (280), 27 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-11-10 00:58:54,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:54,798 INFO L225 Difference]: With dead ends: 31989 [2024-11-10 00:58:54,798 INFO L226 Difference]: Without dead ends: 27066 [2024-11-10 00:58:54,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=859, Invalid=3697, Unknown=0, NotChecked=0, Total=4556 [2024-11-10 00:58:54,812 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 25636 mSDsluCounter, 12109 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25636 SdHoareTripleChecker+Valid, 14336 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:54,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25636 Valid, 14336 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:58:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27066 states. [2024-11-10 00:58:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27066 to 26808. [2024-11-10 00:58:55,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26808 states, 26806 states have (on average 1.3913302991867493) internal successors, (37296), 26807 states have internal predecessors, (37296), 0 states have call successors, (0), 0 states have 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:58:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26808 states to 26808 states and 37296 transitions. [2024-11-10 00:58:55,450 INFO L78 Accepts]: Start accepts. Automaton has 26808 states and 37296 transitions. Word has length 106 [2024-11-10 00:58:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:55,450 INFO L471 AbstractCegarLoop]: Abstraction has 26808 states and 37296 transitions. [2024-11-10 00:58:55,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.0) internal successors, (280), 27 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have 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:58:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 26808 states and 37296 transitions. [2024-11-10 00:58:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:58:55,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:55,455 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:55,470 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:58:55,656 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,SelfDestructingSolverStorable26 [2024-11-10 00:58:55,656 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:55,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash 105713073, now seen corresponding path program 1 times [2024-11-10 00:58:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:55,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138070599] [2024-11-10 00:58:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:56,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:56,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138070599] [2024-11-10 00:58:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138070599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:58:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329636827] [2024-11-10 00:58:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:56,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:58:56,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:56,136 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:58:56,138 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:58:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:56,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 00:58:56,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:58:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:58,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:59:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:00,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329636827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:59:00,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:59:00,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 35 [2024-11-10 00:59:00,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855761879] [2024-11-10 00:59:00,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:59:00,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 00:59:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:00,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 00:59:00,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 00:59:00,706 INFO L87 Difference]: Start difference. First operand 26808 states and 37296 transitions. Second operand has 36 states, 36 states have (on average 7.555555555555555) internal successors, (272), 35 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)