./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label04.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 a42cc7b23356af8f990e37e65409357e19b65ee1c31777e57e6bb4b8aaa5354c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:52:17,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:52:17,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:52:17,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:52:17,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:52:17,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:52:17,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:52:17,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:52:17,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:52:17,282 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:52:17,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:52:17,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:52:17,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:52:17,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:52:17,286 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:52:17,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:52:17,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:52:17,287 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:52:17,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:52:17,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:52:17,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:52:17,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:52:17,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:52:17,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:52:17,292 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:52:17,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:52:17,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:52:17,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:52:17,293 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:52:17,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:52:17,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:52:17,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:52:17,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:52:17,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:52:17,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:52:17,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:52:17,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:52:17,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:52:17,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:52:17,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:52:17,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:52:17,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:52:17,296 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 -> a42cc7b23356af8f990e37e65409357e19b65ee1c31777e57e6bb4b8aaa5354c [2024-11-10 00:52:17,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:52:17,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:52:17,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:52:17,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:52:17,566 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:52:17,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:52:18,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:52:19,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:52:19,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:52:19,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45797838d/81cbabe4831b473a8f379074d99a3999/FLAGb0a05da68 [2024-11-10 00:52:19,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45797838d/81cbabe4831b473a8f379074d99a3999 [2024-11-10 00:52:19,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:52:19,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:52:19,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:52:19,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:52:19,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:52:19,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:19,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e43426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19, skipping insertion in model container [2024-11-10 00:52:19,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:19,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:52:19,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[8786,8799] [2024-11-10 00:52:20,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[15847,15860] [2024-11-10 00:52:20,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:52:20,727 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:52:20,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[8786,8799] [2024-11-10 00:52:20,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[15847,15860] [2024-11-10 00:52:21,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:52:21,194 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:52:21,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21 WrapperNode [2024-11-10 00:52:21,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:52:21,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:52:21,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:52:21,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:52:21,204 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:52:21" (1/1) ... [2024-11-10 00:52:21,270 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:52:21" (1/1) ... [2024-11-10 00:52:21,562 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5035 [2024-11-10 00:52:21,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:52:21,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:52:21,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:52:21,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:52:21,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (1/1) ... [2024-11-10 00:52:21,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (1/1) ... [2024-11-10 00:52:21,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (1/1) ... [2024-11-10 00:52:21,882 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:52:21,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (1/1) ... [2024-11-10 00:52:21,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (1/1) ... [2024-11-10 00:52:22,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (1/1) ... [2024-11-10 00:52:22,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (1/1) ... [2024-11-10 00:52:22,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (1/1) ... [2024-11-10 00:52:22,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (1/1) ... [2024-11-10 00:52:22,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:52:22,271 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:52:22,272 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:52:22,272 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:52:22,273 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (1/1) ... [2024-11-10 00:52:22,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:52:22,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:22,349 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:52:22,365 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:52:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:52:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:52:22,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:52:22,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:52:22,518 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:52:22,520 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:52:28,106 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5024: havoc calculate_output3_#t~ret35#1; [2024-11-10 00:52:28,106 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: havoc calculate_output_#t~ret33#1; [2024-11-10 00:52:28,107 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3534: havoc calculate_output2_#t~ret34#1; [2024-11-10 00:52:28,449 INFO L? ?]: Removed 2076 outVars from TransFormulas that were not future-live. [2024-11-10 00:52:28,450 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:52:28,498 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:52:28,500 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:52:28,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:52:28 BoogieIcfgContainer [2024-11-10 00:52:28,501 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:52:28,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:52:28,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:52:28,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:52:28,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:52:19" (1/3) ... [2024-11-10 00:52:28,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f62c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:52:28, skipping insertion in model container [2024-11-10 00:52:28,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:21" (2/3) ... [2024-11-10 00:52:28,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f62c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:52:28, skipping insertion in model container [2024-11-10 00:52:28,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:52:28" (3/3) ... [2024-11-10 00:52:28,512 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:52:28,529 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:52:28,530 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:52:28,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:52:28,640 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;@347ce4c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:52:28,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:52:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 892 states, 889 states have (on average 2.6636670416197976) internal successors, (2368), 891 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:52:28,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:28,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:28,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash -576025244, now seen corresponding path program 1 times [2024-11-10 00:52:28,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:28,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309291137] [2024-11-10 00:52:28,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:28,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:28,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:28,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309291137] [2024-11-10 00:52:28,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309291137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:28,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:28,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:52:28,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118031965] [2024-11-10 00:52:28,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:28,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:52:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:28,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:52:28,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:52:28,958 INFO L87 Difference]: Start difference. First operand has 892 states, 889 states have (on average 2.6636670416197976) internal successors, (2368), 891 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:29,049 INFO L93 Difference]: Finished difference Result 1751 states and 4678 transitions. [2024-11-10 00:52:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:52:29,052 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 00:52:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:29,071 INFO L225 Difference]: With dead ends: 1751 [2024-11-10 00:52:29,071 INFO L226 Difference]: Without dead ends: 824 [2024-11-10 00:52:29,077 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:52:29,080 INFO L432 NwaCegarLoop]: 2297 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, 2297 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:52:29,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-11-10 00:52:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-11-10 00:52:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 822 states have (on average 2.71654501216545) internal successors, (2233), 823 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2233 transitions. [2024-11-10 00:52:29,174 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2233 transitions. Word has length 24 [2024-11-10 00:52:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:29,175 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 2233 transitions. [2024-11-10 00:52:29,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2233 transitions. [2024-11-10 00:52:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:52:29,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:29,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:29,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:52:29,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:29,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1573097597, now seen corresponding path program 1 times [2024-11-10 00:52:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374132017] [2024-11-10 00:52:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:29,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:29,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374132017] [2024-11-10 00:52:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374132017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:29,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:52:29,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339345860] [2024-11-10 00:52:29,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:29,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:52:29,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:29,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:52:29,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:29,432 INFO L87 Difference]: Start difference. First operand 824 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:29,543 INFO L93 Difference]: Finished difference Result 867 states and 2297 transitions. [2024-11-10 00:52:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:52:29,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 00:52:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:29,550 INFO L225 Difference]: With dead ends: 867 [2024-11-10 00:52:29,550 INFO L226 Difference]: Without dead ends: 824 [2024-11-10 00:52:29,551 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:52:29,552 INFO L432 NwaCegarLoop]: 2231 mSDtfsCounter, 0 mSDsluCounter, 6665 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8896 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:29,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8896 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-11-10 00:52:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-11-10 00:52:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 822 states have (on average 2.6885644768856447) internal successors, (2210), 823 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2210 transitions. [2024-11-10 00:52:29,581 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2210 transitions. Word has length 24 [2024-11-10 00:52:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:29,581 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 2210 transitions. [2024-11-10 00:52:29,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2210 transitions. [2024-11-10 00:52:29,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 00:52:29,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:29,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:29,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:52:29,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:29,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash 67352845, now seen corresponding path program 1 times [2024-11-10 00:52:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:29,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313593716] [2024-11-10 00:52:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:29,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:29,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:29,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313593716] [2024-11-10 00:52:29,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313593716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:29,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:29,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:29,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795156360] [2024-11-10 00:52:29,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:29,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:29,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:29,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:29,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:29,774 INFO L87 Difference]: Start difference. First operand 824 states and 2210 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:29,967 INFO L93 Difference]: Finished difference Result 1136 states and 2690 transitions. [2024-11-10 00:52:29,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:52:29,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-10 00:52:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:29,974 INFO L225 Difference]: With dead ends: 1136 [2024-11-10 00:52:29,974 INFO L226 Difference]: Without dead ends: 1097 [2024-11-10 00:52:29,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:52:29,976 INFO L432 NwaCegarLoop]: 2206 mSDtfsCounter, 8967 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8967 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:29,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8967 Valid, 3042 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-10 00:52:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 860. [2024-11-10 00:52:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 2.641025641025641) internal successors, (2266), 859 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2266 transitions. [2024-11-10 00:52:30,001 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2266 transitions. Word has length 46 [2024-11-10 00:52:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:30,002 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 2266 transitions. [2024-11-10 00:52:30,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2266 transitions. [2024-11-10 00:52:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 00:52:30,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:30,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:30,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:52:30,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:30,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:30,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1704032145, now seen corresponding path program 1 times [2024-11-10 00:52:30,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:30,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080548587] [2024-11-10 00:52:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:30,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080548587] [2024-11-10 00:52:30,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080548587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:30,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601645410] [2024-11-10 00:52:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:30,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:30,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:30,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:30,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:30,266 INFO L87 Difference]: Start difference. First operand 860 states and 2266 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:30,429 INFO L93 Difference]: Finished difference Result 938 states and 2384 transitions. [2024-11-10 00:52:30,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:30,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-10 00:52:30,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:30,435 INFO L225 Difference]: With dead ends: 938 [2024-11-10 00:52:30,436 INFO L226 Difference]: Without dead ends: 863 [2024-11-10 00:52:30,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:52:30,441 INFO L432 NwaCegarLoop]: 2204 mSDtfsCounter, 6498 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6498 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:30,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6498 Valid, 2372 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-10 00:52:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 860. [2024-11-10 00:52:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 2.63986013986014) internal successors, (2265), 859 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2265 transitions. [2024-11-10 00:52:30,464 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2265 transitions. Word has length 48 [2024-11-10 00:52:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:30,465 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 2265 transitions. [2024-11-10 00:52:30,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2265 transitions. [2024-11-10 00:52:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 00:52:30,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:30,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:30,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:52:30,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:30,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:30,471 INFO L85 PathProgramCache]: Analyzing trace with hash 438430262, now seen corresponding path program 1 times [2024-11-10 00:52:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:30,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088675303] [2024-11-10 00:52:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:30,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:30,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088675303] [2024-11-10 00:52:30,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088675303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:30,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:30,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590343228] [2024-11-10 00:52:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:30,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:30,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:30,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:30,560 INFO L87 Difference]: Start difference. First operand 860 states and 2265 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:30,597 INFO L93 Difference]: Finished difference Result 998 states and 2475 transitions. [2024-11-10 00:52:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:30,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-10 00:52:30,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:30,603 INFO L225 Difference]: With dead ends: 998 [2024-11-10 00:52:30,603 INFO L226 Difference]: Without dead ends: 923 [2024-11-10 00:52:30,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:30,604 INFO L432 NwaCegarLoop]: 2216 mSDtfsCounter, 2158 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2271 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:52:30,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2271 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-10 00:52:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2024-11-10 00:52:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 918 states have (on average 2.565359477124183) internal successors, (2355), 919 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2355 transitions. [2024-11-10 00:52:30,630 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2355 transitions. Word has length 49 [2024-11-10 00:52:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:30,631 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 2355 transitions. [2024-11-10 00:52:30,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2355 transitions. [2024-11-10 00:52:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:30,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:30,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:30,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:52:30,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:30,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1147349681, now seen corresponding path program 1 times [2024-11-10 00:52:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:30,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716358148] [2024-11-10 00:52:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:30,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:30,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716358148] [2024-11-10 00:52:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716358148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:30,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:30,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:30,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690731874] [2024-11-10 00:52:30,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:30,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:30,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:30,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:30,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:30,693 INFO L87 Difference]: Start difference. First operand 920 states and 2355 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:30,721 INFO L93 Difference]: Finished difference Result 1065 states and 2575 transitions. [2024-11-10 00:52:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:30,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:30,726 INFO L225 Difference]: With dead ends: 1065 [2024-11-10 00:52:30,727 INFO L226 Difference]: Without dead ends: 990 [2024-11-10 00:52:30,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:30,728 INFO L432 NwaCegarLoop]: 2254 mSDtfsCounter, 2170 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2315 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:52:30,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2315 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-10 00:52:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 987. [2024-11-10 00:52:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 985 states have (on average 2.4923857868020303) internal successors, (2455), 986 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2455 transitions. [2024-11-10 00:52:30,752 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2455 transitions. Word has length 50 [2024-11-10 00:52:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:30,753 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 2455 transitions. [2024-11-10 00:52:30,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2455 transitions. [2024-11-10 00:52:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:30,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:30,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:30,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:52:30,754 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:30,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 145939953, now seen corresponding path program 1 times [2024-11-10 00:52:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:30,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935267334] [2024-11-10 00:52:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:30,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:30,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935267334] [2024-11-10 00:52:30,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935267334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:30,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:30,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:30,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813845121] [2024-11-10 00:52:30,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:30,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:30,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:30,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:30,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:30,841 INFO L87 Difference]: Start difference. First operand 987 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:30,870 INFO L93 Difference]: Finished difference Result 1361 states and 3017 transitions. [2024-11-10 00:52:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:30,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:30,875 INFO L225 Difference]: With dead ends: 1361 [2024-11-10 00:52:30,875 INFO L226 Difference]: Without dead ends: 1162 [2024-11-10 00:52:30,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:30,877 INFO L432 NwaCegarLoop]: 2256 mSDtfsCounter, 2168 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:30,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 2321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-11-10 00:52:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1159. [2024-11-10 00:52:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1157 states have (on average 2.3396715643906654) internal successors, (2707), 1158 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2707 transitions. [2024-11-10 00:52:30,902 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2707 transitions. Word has length 50 [2024-11-10 00:52:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:30,902 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 2707 transitions. [2024-11-10 00:52:30,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2707 transitions. [2024-11-10 00:52:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:30,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:30,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:30,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:52:30,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:30,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 131490097, now seen corresponding path program 1 times [2024-11-10 00:52:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:30,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435199275] [2024-11-10 00:52:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435199275] [2024-11-10 00:52:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435199275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112461016] [2024-11-10 00:52:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:30,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:30,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:30,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:30,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:30,954 INFO L87 Difference]: Start difference. First operand 1159 states and 2707 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:30,988 INFO L93 Difference]: Finished difference Result 1853 states and 3731 transitions. [2024-11-10 00:52:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:30,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:30,995 INFO L225 Difference]: With dead ends: 1853 [2024-11-10 00:52:30,995 INFO L226 Difference]: Without dead ends: 1482 [2024-11-10 00:52:30,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:30,997 INFO L432 NwaCegarLoop]: 2254 mSDtfsCounter, 2166 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 2323 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:52:30,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 2323 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2024-11-10 00:52:31,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1479. [2024-11-10 00:52:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1477 states have (on average 2.1415030467163167) internal successors, (3163), 1478 states have internal predecessors, (3163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3163 transitions. [2024-11-10 00:52:31,034 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3163 transitions. Word has length 50 [2024-11-10 00:52:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:31,034 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 3163 transitions. [2024-11-10 00:52:31,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3163 transitions. [2024-11-10 00:52:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:31,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:31,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:31,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:52:31,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:31,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2071874447, now seen corresponding path program 1 times [2024-11-10 00:52:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:31,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856816341] [2024-11-10 00:52:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:31,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:31,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:31,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856816341] [2024-11-10 00:52:31,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856816341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:31,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:31,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:31,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834254077] [2024-11-10 00:52:31,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:31,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:31,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:31,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:31,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:31,114 INFO L87 Difference]: Start difference. First operand 1479 states and 3163 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:31,156 INFO L93 Difference]: Finished difference Result 2765 states and 5015 transitions. [2024-11-10 00:52:31,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:31,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:31,166 INFO L225 Difference]: With dead ends: 2765 [2024-11-10 00:52:31,166 INFO L226 Difference]: Without dead ends: 2074 [2024-11-10 00:52:31,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:31,170 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 2164 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 2325 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:52:31,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 2325 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2024-11-10 00:52:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2071. [2024-11-10 00:52:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2069 states have (on average 1.9231512808119864) internal successors, (3979), 2070 states have internal predecessors, (3979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3979 transitions. [2024-11-10 00:52:31,223 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3979 transitions. Word has length 50 [2024-11-10 00:52:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:31,224 INFO L471 AbstractCegarLoop]: Abstraction has 2071 states and 3979 transitions. [2024-11-10 00:52:31,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3979 transitions. [2024-11-10 00:52:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:31,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:31,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:31,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:52:31,226 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:31,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1698815794, now seen corresponding path program 1 times [2024-11-10 00:52:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:31,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133120509] [2024-11-10 00:52:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:31,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:31,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:31,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133120509] [2024-11-10 00:52:31,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133120509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:31,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:31,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:52:31,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854511497] [2024-11-10 00:52:31,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:31,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:52:31,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:52:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:31,420 INFO L87 Difference]: Start difference. First operand 2071 states and 3979 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:31,480 INFO L93 Difference]: Finished difference Result 2170 states and 4109 transitions. [2024-11-10 00:52:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:52:31,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:31,489 INFO L225 Difference]: With dead ends: 2170 [2024-11-10 00:52:31,489 INFO L226 Difference]: Without dead ends: 2167 [2024-11-10 00:52:31,490 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:52:31,490 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 0 mSDsluCounter, 6612 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8819 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:31,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8819 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2024-11-10 00:52:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2167. [2024-11-10 00:52:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2165 states have (on average 1.8785219399538107) internal successors, (4067), 2166 states have internal predecessors, (4067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 4067 transitions. [2024-11-10 00:52:31,541 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 4067 transitions. Word has length 50 [2024-11-10 00:52:31,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:31,542 INFO L471 AbstractCegarLoop]: Abstraction has 2167 states and 4067 transitions. [2024-11-10 00:52:31,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 4067 transitions. [2024-11-10 00:52:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 00:52:31,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:31,543 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] [2024-11-10 00:52:31,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:52:31,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:31,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1893743981, now seen corresponding path program 1 times [2024-11-10 00:52:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:31,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975606661] [2024-11-10 00:52:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:31,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:31,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:31,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975606661] [2024-11-10 00:52:31,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975606661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:31,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:31,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363485126] [2024-11-10 00:52:31,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:31,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:52:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:31,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:52:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:52:31,670 INFO L87 Difference]: Start difference. First operand 2167 states and 4067 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:39,194 INFO L93 Difference]: Finished difference Result 4426 states and 10420 transitions. [2024-11-10 00:52:39,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:52:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-10 00:52:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:39,210 INFO L225 Difference]: With dead ends: 4426 [2024-11-10 00:52:39,211 INFO L226 Difference]: Without dead ends: 3671 [2024-11-10 00:52:39,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:39,213 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 4417 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4417 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:39,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4417 Valid, 807 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-11-10 00:52:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2024-11-10 00:52:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3671. [2024-11-10 00:52:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3669 states have (on average 2.018261106568547) internal successors, (7405), 3670 states have internal predecessors, (7405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 7405 transitions. [2024-11-10 00:52:39,294 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 7405 transitions. Word has length 63 [2024-11-10 00:52:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:39,295 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 7405 transitions. [2024-11-10 00:52:39,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 7405 transitions. [2024-11-10 00:52:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:39,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:39,297 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:39,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:52:39,297 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:39,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:39,297 INFO L85 PathProgramCache]: Analyzing trace with hash -26766179, now seen corresponding path program 1 times [2024-11-10 00:52:39,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:39,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634642797] [2024-11-10 00:52:39,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:39,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:52:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634642797] [2024-11-10 00:52:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634642797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:39,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:39,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218968349] [2024-11-10 00:52:39,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:39,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:39,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:39,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:39,445 INFO L87 Difference]: Start difference. First operand 3671 states and 7405 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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:52:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:39,642 INFO L93 Difference]: Finished difference Result 9118 states and 14951 transitions. [2024-11-10 00:52:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:39,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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 69 [2024-11-10 00:52:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:39,681 INFO L225 Difference]: With dead ends: 9118 [2024-11-10 00:52:39,681 INFO L226 Difference]: Without dead ends: 8123 [2024-11-10 00:52:39,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:39,688 INFO L432 NwaCegarLoop]: 2265 mSDtfsCounter, 6705 mSDsluCounter, 2518 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6705 SdHoareTripleChecker+Valid, 4783 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:39,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6705 Valid, 4783 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8123 states. [2024-11-10 00:52:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8123 to 4863. [2024-11-10 00:52:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 4861 states have (on average 1.859082493314133) internal successors, (9037), 4862 states have internal predecessors, (9037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 9037 transitions. [2024-11-10 00:52:39,879 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 9037 transitions. Word has length 69 [2024-11-10 00:52:39,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:39,880 INFO L471 AbstractCegarLoop]: Abstraction has 4863 states and 9037 transitions. [2024-11-10 00:52:39,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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:52:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 9037 transitions. [2024-11-10 00:52:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:39,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:39,885 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:39,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:52:39,885 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:39,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:39,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1028175907, now seen corresponding path program 1 times [2024-11-10 00:52:39,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:39,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822924014] [2024-11-10 00:52:39,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:52:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:40,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822924014] [2024-11-10 00:52:40,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822924014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:40,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:40,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:40,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572726072] [2024-11-10 00:52:40,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:40,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:40,025 INFO L87 Difference]: Start difference. First operand 4863 states and 9037 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:40,245 INFO L93 Difference]: Finished difference Result 10494 states and 16847 transitions. [2024-11-10 00:52:40,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:40,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:52:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:40,270 INFO L225 Difference]: With dead ends: 10494 [2024-11-10 00:52:40,270 INFO L226 Difference]: Without dead ends: 9115 [2024-11-10 00:52:40,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:40,277 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 6707 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6707 SdHoareTripleChecker+Valid, 4757 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:40,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6707 Valid, 4757 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9115 states. [2024-11-10 00:52:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9115 to 6735. [2024-11-10 00:52:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6735 states, 6733 states have (on average 1.7224120005940888) internal successors, (11597), 6734 states have internal predecessors, (11597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6735 states to 6735 states and 11597 transitions. [2024-11-10 00:52:40,481 INFO L78 Accepts]: Start accepts. Automaton has 6735 states and 11597 transitions. Word has length 69 [2024-11-10 00:52:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:40,482 INFO L471 AbstractCegarLoop]: Abstraction has 6735 states and 11597 transitions. [2024-11-10 00:52:40,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 6735 states and 11597 transitions. [2024-11-10 00:52:40,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:40,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:40,484 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:40,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:52:40,484 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:40,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1042625763, now seen corresponding path program 1 times [2024-11-10 00:52:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:40,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577064465] [2024-11-10 00:52:40,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:40,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:52:40,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:40,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577064465] [2024-11-10 00:52:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577064465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:40,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:40,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:40,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194635972] [2024-11-10 00:52:40,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:40,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:40,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:40,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:40,604 INFO L87 Difference]: Start difference. First operand 6735 states and 11597 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:40,837 INFO L93 Difference]: Finished difference Result 11870 states and 18735 transitions. [2024-11-10 00:52:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:40,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:52:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:40,857 INFO L225 Difference]: With dead ends: 11870 [2024-11-10 00:52:40,857 INFO L226 Difference]: Without dead ends: 10491 [2024-11-10 00:52:40,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:40,863 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 6731 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6731 SdHoareTripleChecker+Valid, 4738 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:40,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6731 Valid, 4738 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10491 states. [2024-11-10 00:52:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10491 to 8111. [2024-11-10 00:52:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8111 states, 8109 states have (on average 1.6629670736219015) internal successors, (13485), 8110 states have internal predecessors, (13485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8111 states to 8111 states and 13485 transitions. [2024-11-10 00:52:41,062 INFO L78 Accepts]: Start accepts. Automaton has 8111 states and 13485 transitions. Word has length 69 [2024-11-10 00:52:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:41,062 INFO L471 AbstractCegarLoop]: Abstraction has 8111 states and 13485 transitions. [2024-11-10 00:52:41,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand 8111 states and 13485 transitions. [2024-11-10 00:52:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:41,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:41,065 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:41,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:52:41,065 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:41,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1048976989, now seen corresponding path program 1 times [2024-11-10 00:52:41,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:41,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455566613] [2024-11-10 00:52:41,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:41,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:52:41,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455566613] [2024-11-10 00:52:41,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455566613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:41,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:41,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16573786] [2024-11-10 00:52:41,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:41,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:41,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:41,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:41,188 INFO L87 Difference]: Start difference. First operand 8111 states and 13485 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:41,481 INFO L93 Difference]: Finished difference Result 13246 states and 20623 transitions. [2024-11-10 00:52:41,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:41,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:52:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:41,504 INFO L225 Difference]: With dead ends: 13246 [2024-11-10 00:52:41,505 INFO L226 Difference]: Without dead ends: 11867 [2024-11-10 00:52:41,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:41,511 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 6721 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6721 SdHoareTripleChecker+Valid, 4764 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:41,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6721 Valid, 4764 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2024-11-10 00:52:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 9487. [2024-11-10 00:52:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9487 states, 9485 states have (on average 1.6207696362677912) internal successors, (15373), 9486 states have internal predecessors, (15373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9487 states to 9487 states and 15373 transitions. [2024-11-10 00:52:41,724 INFO L78 Accepts]: Start accepts. Automaton has 9487 states and 15373 transitions. Word has length 69 [2024-11-10 00:52:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:41,724 INFO L471 AbstractCegarLoop]: Abstraction has 9487 states and 15373 transitions. [2024-11-10 00:52:41,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 9487 states and 15373 transitions. [2024-11-10 00:52:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:52:41,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:41,726 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:41,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:52:41,727 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:41,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1958100993, now seen corresponding path program 1 times [2024-11-10 00:52:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:41,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203239201] [2024-11-10 00:52:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:41,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203239201] [2024-11-10 00:52:41,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203239201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:41,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:41,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346513663] [2024-11-10 00:52:41,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:41,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:41,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:41,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:41,817 INFO L87 Difference]: Start difference. First operand 9487 states and 15373 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:41,953 INFO L93 Difference]: Finished difference Result 16685 states and 25257 transitions. [2024-11-10 00:52:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:41,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:52:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:41,972 INFO L225 Difference]: With dead ends: 16685 [2024-11-10 00:52:41,974 INFO L226 Difference]: Without dead ends: 9490 [2024-11-10 00:52:41,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:41,986 INFO L432 NwaCegarLoop]: 2238 mSDtfsCounter, 36 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4436 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:41,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4436 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9490 states. [2024-11-10 00:52:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9490 to 9487. [2024-11-10 00:52:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9487 states, 9485 states have (on average 1.6076963626779124) internal successors, (15249), 9486 states have internal predecessors, (15249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9487 states to 9487 states and 15249 transitions. [2024-11-10 00:52:42,186 INFO L78 Accepts]: Start accepts. Automaton has 9487 states and 15249 transitions. Word has length 71 [2024-11-10 00:52:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:42,187 INFO L471 AbstractCegarLoop]: Abstraction has 9487 states and 15249 transitions. [2024-11-10 00:52:42,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 9487 states and 15249 transitions. [2024-11-10 00:52:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:52:42,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:42,189 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:42,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:52:42,189 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:42,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2054791999, now seen corresponding path program 1 times [2024-11-10 00:52:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:42,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306168196] [2024-11-10 00:52:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:42,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:42,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:42,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306168196] [2024-11-10 00:52:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306168196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:42,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:42,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617995023] [2024-11-10 00:52:42,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:42,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:42,285 INFO L87 Difference]: Start difference. First operand 9487 states and 15249 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:42,455 INFO L93 Difference]: Finished difference Result 12240 states and 19013 transitions. [2024-11-10 00:52:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:52:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:42,466 INFO L225 Difference]: With dead ends: 12240 [2024-11-10 00:52:42,466 INFO L226 Difference]: Without dead ends: 5045 [2024-11-10 00:52:42,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:42,474 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 32 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:42,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4433 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2024-11-10 00:52:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 5035. [2024-11-10 00:52:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5035 states, 5033 states have (on average 1.8281343135306973) internal successors, (9201), 5034 states have internal predecessors, (9201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 9201 transitions. [2024-11-10 00:52:42,615 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 9201 transitions. Word has length 71 [2024-11-10 00:52:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:42,616 INFO L471 AbstractCegarLoop]: Abstraction has 5035 states and 9201 transitions. [2024-11-10 00:52:42,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 9201 transitions. [2024-11-10 00:52:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:52:42,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:42,618 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] [2024-11-10 00:52:42,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:52:42,618 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:42,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:42,619 INFO L85 PathProgramCache]: Analyzing trace with hash 798912897, now seen corresponding path program 1 times [2024-11-10 00:52:42,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:42,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451148796] [2024-11-10 00:52:42,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:42,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451148796] [2024-11-10 00:52:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451148796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:42,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536725304] [2024-11-10 00:52:42,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:42,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:42,727 INFO L87 Difference]: Start difference. First operand 5035 states and 9201 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:42,801 INFO L93 Difference]: Finished difference Result 6405 states and 11053 transitions. [2024-11-10 00:52:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:42,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 00:52:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:42,809 INFO L225 Difference]: With dead ends: 6405 [2024-11-10 00:52:42,810 INFO L226 Difference]: Without dead ends: 3674 [2024-11-10 00:52:42,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:42,815 INFO L432 NwaCegarLoop]: 2230 mSDtfsCounter, 30 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4412 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:42,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4412 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2024-11-10 00:52:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3671. [2024-11-10 00:52:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3669 states have (on average 1.998092123194331) internal successors, (7331), 3670 states have internal predecessors, (7331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 7331 transitions. [2024-11-10 00:52:42,915 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 7331 transitions. Word has length 73 [2024-11-10 00:52:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:42,916 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 7331 transitions. [2024-11-10 00:52:42,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 7331 transitions. [2024-11-10 00:52:42,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:52:42,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:42,918 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:42,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:52:42,918 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:42,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1102118600, now seen corresponding path program 1 times [2024-11-10 00:52:42,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:42,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138622340] [2024-11-10 00:52:42,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:43,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138622340] [2024-11-10 00:52:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138622340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:43,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:43,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:43,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874486068] [2024-11-10 00:52:43,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:43,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:43,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:43,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:43,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:43,019 INFO L87 Difference]: Start difference. First operand 3671 states and 7331 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:43,075 INFO L93 Difference]: Finished difference Result 4359 states and 8248 transitions. [2024-11-10 00:52:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:43,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-10 00:52:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:43,082 INFO L225 Difference]: With dead ends: 4359 [2024-11-10 00:52:43,082 INFO L226 Difference]: Without dead ends: 2992 [2024-11-10 00:52:43,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:43,085 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 27 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4397 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:43,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4397 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2024-11-10 00:52:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2989. [2024-11-10 00:52:43,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2987 states have (on average 2.144961499832608) internal successors, (6407), 2988 states have internal predecessors, (6407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 6407 transitions. [2024-11-10 00:52:43,134 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 6407 transitions. Word has length 75 [2024-11-10 00:52:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:43,134 INFO L471 AbstractCegarLoop]: Abstraction has 2989 states and 6407 transitions. [2024-11-10 00:52:43,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 6407 transitions. [2024-11-10 00:52:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:52:43,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:43,136 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:43,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:52:43,136 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:43,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1394283217, now seen corresponding path program 1 times [2024-11-10 00:52:43,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:43,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162888454] [2024-11-10 00:52:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:43,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:43,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:43,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162888454] [2024-11-10 00:52:43,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162888454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:43,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874354805] [2024-11-10 00:52:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:43,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:43,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:43,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:43,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:52:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:43,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 00:52:43,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:45,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:46,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874354805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:46,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:46,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 33 [2024-11-10 00:52:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938086021] [2024-11-10 00:52:46,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:46,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 00:52:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:46,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 00:52:46,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 00:52:46,664 INFO L87 Difference]: Start difference. First operand 2989 states and 6407 transitions. Second operand has 33 states, 33 states have (on average 6.393939393939394) internal successors, (211), 33 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:50,522 INFO L93 Difference]: Finished difference Result 6596 states and 11164 transitions. [2024-11-10 00:52:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-10 00:52:50,523 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.393939393939394) internal successors, (211), 33 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 00:52:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:50,532 INFO L225 Difference]: With dead ends: 6596 [2024-11-10 00:52:50,533 INFO L226 Difference]: Without dead ends: 5911 [2024-11-10 00:52:50,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1482, Invalid=6000, Unknown=0, NotChecked=0, Total=7482 [2024-11-10 00:52:50,538 INFO L432 NwaCegarLoop]: 2177 mSDtfsCounter, 28468 mSDsluCounter, 13561 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28468 SdHoareTripleChecker+Valid, 15738 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:50,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28468 Valid, 15738 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:52:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2024-11-10 00:52:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 5876. [2024-11-10 00:52:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 5874 states have (on average 1.72642151855635) internal successors, (10141), 5875 states have internal predecessors, (10141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 10141 transitions. [2024-11-10 00:52:50,677 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 10141 transitions. Word has length 77 [2024-11-10 00:52:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:50,677 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 10141 transitions. [2024-11-10 00:52:50,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.393939393939394) internal successors, (211), 33 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 10141 transitions. [2024-11-10 00:52:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:52:50,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:50,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:50,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 00:52:50,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:50,880 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:50,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:50,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1476797615, now seen corresponding path program 1 times [2024-11-10 00:52:50,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:50,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446328857] [2024-11-10 00:52:50,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:50,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446328857] [2024-11-10 00:52:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446328857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089690950] [2024-11-10 00:52:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:51,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:51,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:52:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:51,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:52:51,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:51,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089690950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:52,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:52,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-10 00:52:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431524969] [2024-11-10 00:52:52,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:52,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 00:52:52,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:52,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 00:52:52,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-11-10 00:52:52,357 INFO L87 Difference]: Start difference. First operand 5876 states and 10141 transitions. Second operand has 26 states, 26 states have (on average 7.346153846153846) internal successors, (191), 25 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:53,686 INFO L93 Difference]: Finished difference Result 20833 states and 29689 transitions. [2024-11-10 00:52:53,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 00:52:53,687 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.346153846153846) internal successors, (191), 25 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 00:52:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:53,709 INFO L225 Difference]: With dead ends: 20833 [2024-11-10 00:52:53,709 INFO L226 Difference]: Without dead ends: 17261 [2024-11-10 00:52:53,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=629, Invalid=2341, Unknown=0, NotChecked=0, Total=2970 [2024-11-10 00:52:53,720 INFO L432 NwaCegarLoop]: 2201 mSDtfsCounter, 22398 mSDsluCounter, 9437 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22398 SdHoareTripleChecker+Valid, 11638 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:53,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22398 Valid, 11638 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:52:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17261 states. [2024-11-10 00:52:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17261 to 17023. [2024-11-10 00:52:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17023 states, 17021 states have (on average 1.425826919687445) internal successors, (24269), 17022 states have internal predecessors, (24269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17023 states to 17023 states and 24269 transitions. [2024-11-10 00:52:54,410 INFO L78 Accepts]: Start accepts. Automaton has 17023 states and 24269 transitions. Word has length 77 [2024-11-10 00:52:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:54,410 INFO L471 AbstractCegarLoop]: Abstraction has 17023 states and 24269 transitions. [2024-11-10 00:52:54,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.346153846153846) internal successors, (191), 25 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 17023 states and 24269 transitions. [2024-11-10 00:52:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:52:54,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:54,413 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:54,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:52:54,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-10 00:52:54,618 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:54,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash -114225462, now seen corresponding path program 1 times [2024-11-10 00:52:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:54,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429540817] [2024-11-10 00:52:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:57,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429540817] [2024-11-10 00:52:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429540817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884792962] [2024-11-10 00:52:57,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:57,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:57,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:52:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:57,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 00:52:57,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:53:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:53:01,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:53:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:53:05,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884792962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:53:05,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:53:05,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 20] total 62 [2024-11-10 00:53:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115790505] [2024-11-10 00:53:05,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:53:05,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-10 00:53:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:05,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-10 00:53:05,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=3457, Unknown=0, NotChecked=0, Total=3782 [2024-11-10 00:53:05,677 INFO L87 Difference]: Start difference. First operand 17023 states and 24269 transitions. Second operand has 62 states, 62 states have (on average 3.5) internal successors, (217), 62 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)