./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1a770e072308583e36326282bebae23c1c98c748d42f3621fe7141c74e78b303 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:41:55,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:41:55,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:41:55,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:41:55,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:41:55,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:41:55,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:41:55,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:41:55,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:41:55,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:41:55,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:41:55,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:41:55,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:41:55,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:41:55,660 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:41:55,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:41:55,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:41:55,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:41:55,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:41:55,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:41:55,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:41:55,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:41:55,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:41:55,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:41:55,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:41:55,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:41:55,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:41:55,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:41:55,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:41:55,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:41:55,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:41:55,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:41:55,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:41:55,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:41:55,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:41:55,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:41:55,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:41:55,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:41:55,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:41:55,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:41:55,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:41:55,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:41:55,674 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-clean/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-clean/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 -> 1a770e072308583e36326282bebae23c1c98c748d42f3621fe7141c74e78b303 [2024-10-11 04:41:55,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:41:55,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:41:55,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:41:55,955 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:41:55,957 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:41:55,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c [2024-10-11 04:41:57,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:41:57,781 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:41:57,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c [2024-10-11 04:41:57,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/394bfa6fc/e3a3bb6ccec4493a888ad34bcfb55720/FLAG24c4e4f29 [2024-10-11 04:41:57,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/394bfa6fc/e3a3bb6ccec4493a888ad34bcfb55720 [2024-10-11 04:41:57,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:41:57,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:41:57,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:41:57,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:41:57,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:41:57,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:41:57" (1/1) ... [2024-10-11 04:41:57,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c21f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:57, skipping insertion in model container [2024-10-11 04:41:57,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:41:57" (1/1) ... [2024-10-11 04:41:58,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:41:58,302 WARN L248 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.3.ufo.BOUNDED-6.pals+Problem12_label07.c[6354,6367] [2024-10-11 04:41:58,318 WARN L248 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.3.ufo.BOUNDED-6.pals+Problem12_label07.c[7196,7209] [2024-10-11 04:41:59,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:41:59,025 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:41:59,061 WARN L248 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.3.ufo.BOUNDED-6.pals+Problem12_label07.c[6354,6367] [2024-10-11 04:41:59,063 WARN L248 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.3.ufo.BOUNDED-6.pals+Problem12_label07.c[7196,7209] [2024-10-11 04:41:59,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:41:59,500 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:41:59,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59 WrapperNode [2024-10-11 04:41:59,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:41:59,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:41:59,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:41:59,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:41:59,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:41:59,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:41:59,865 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4983 [2024-10-11 04:41:59,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:41:59,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:41:59,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:41:59,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:41:59,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:41:59,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:41:59,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:42:00,109 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-10-11 04:42:00,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:42:00,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:42:00,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:42:00,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:42:00,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:42:00,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:42:00,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:42:00,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:42:00,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:42:00,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:42:00,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (1/1) ... [2024-10-11 04:42:00,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:42:00,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:00,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:42:00,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:42:00,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:42:00,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:42:00,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:42:00,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:42:00,599 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:42:00,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:42:04,791 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2024-10-11 04:42:04,792 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:42:04,883 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:42:04,885 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:42:04,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:42:04 BoogieIcfgContainer [2024-10-11 04:42:04,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:42:04,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:42:04,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:42:04,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:42:04,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:41:57" (1/3) ... [2024-10-11 04:42:04,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50039438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:42:04, skipping insertion in model container [2024-10-11 04:42:04,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:41:59" (2/3) ... [2024-10-11 04:42:04,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50039438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:42:04, skipping insertion in model container [2024-10-11 04:42:04,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:42:04" (3/3) ... [2024-10-11 04:42:04,896 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label07.c [2024-10-11 04:42:04,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:42:04,913 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:42:05,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:42:05,025 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;@42b6cff0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:42:05,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:42:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 04:42:05,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:05,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 04:42:05,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:05,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:05,051 INFO L85 PathProgramCache]: Analyzing trace with hash 821511842, now seen corresponding path program 1 times [2024-10-11 04:42:05,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:05,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457764567] [2024-10-11 04:42:05,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:05,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:05,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:05,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457764567] [2024-10-11 04:42:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457764567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:05,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:42:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325973403] [2024-10-11 04:42:05,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:05,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:05,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:05,315 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:08,752 INFO L93 Difference]: Finished difference Result 2348 states and 4647 transitions. [2024-10-11 04:42:08,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:08,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 04:42:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:08,778 INFO L225 Difference]: With dead ends: 2348 [2024-10-11 04:42:08,778 INFO L226 Difference]: Without dead ends: 1554 [2024-10-11 04:42:08,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:08,787 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 896 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2283 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:08,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 161 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2283 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 04:42:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2024-10-11 04:42:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2024-10-11 04:42:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1552 states have (on average 1.865979381443299) internal successors, (2896), 1553 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2896 transitions. [2024-10-11 04:42:08,904 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2896 transitions. Word has length 6 [2024-10-11 04:42:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:08,904 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2896 transitions. [2024-10-11 04:42:08,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2896 transitions. [2024-10-11 04:42:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:42:08,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:08,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:08,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:42:08,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:08,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1760192492, now seen corresponding path program 1 times [2024-10-11 04:42:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:08,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599452338] [2024-10-11 04:42:08,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:08,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:09,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:09,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599452338] [2024-10-11 04:42:09,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599452338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:09,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:09,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:42:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170286381] [2024-10-11 04:42:09,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:09,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:42:09,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:09,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:42:09,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:42:09,121 INFO L87 Difference]: Start difference. First operand 1554 states and 2896 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:09,193 INFO L93 Difference]: Finished difference Result 1615 states and 2991 transitions. [2024-10-11 04:42:09,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:42:09,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-11 04:42:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:09,200 INFO L225 Difference]: With dead ends: 1615 [2024-10-11 04:42:09,200 INFO L226 Difference]: Without dead ends: 1583 [2024-10-11 04:42:09,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:42:09,205 INFO L432 NwaCegarLoop]: 1516 mSDtfsCounter, 45 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:09,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4527 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-10-11 04:42:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1554. [2024-10-11 04:42:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1552 states have (on average 1.8556701030927836) internal successors, (2880), 1553 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2880 transitions. [2024-10-11 04:42:09,242 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2880 transitions. Word has length 17 [2024-10-11 04:42:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:09,243 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2880 transitions. [2024-10-11 04:42:09,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2880 transitions. [2024-10-11 04:42:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 04:42:09,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:09,246 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] [2024-10-11 04:42:09,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:42:09,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:09,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:09,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1166183952, now seen corresponding path program 1 times [2024-10-11 04:42:09,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:09,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7668324] [2024-10-11 04:42:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:09,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:09,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7668324] [2024-10-11 04:42:09,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7668324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:09,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:09,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:09,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517833927] [2024-10-11 04:42:09,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:09,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:09,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:09,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:09,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:09,418 INFO L87 Difference]: Start difference. First operand 1554 states and 2880 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:09,551 INFO L93 Difference]: Finished difference Result 1728 states and 3156 transitions. [2024-10-11 04:42:09,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:42:09,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-10-11 04:42:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:09,560 INFO L225 Difference]: With dead ends: 1728 [2024-10-11 04:42:09,562 INFO L226 Difference]: Without dead ends: 1699 [2024-10-11 04:42:09,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:42:09,566 INFO L432 NwaCegarLoop]: 1498 mSDtfsCounter, 4578 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:09,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 1841 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:42:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-10-11 04:42:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1581. [2024-10-11 04:42:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.8511716276124128) internal successors, (2923), 1580 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2923 transitions. [2024-10-11 04:42:09,608 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2923 transitions. Word has length 32 [2024-10-11 04:42:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:09,611 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2923 transitions. [2024-10-11 04:42:09,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2923 transitions. [2024-10-11 04:42:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:42:09,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:09,613 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] [2024-10-11 04:42:09,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:42:09,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:09,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash 160996032, now seen corresponding path program 1 times [2024-10-11 04:42:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521380114] [2024-10-11 04:42:09,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:09,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:09,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521380114] [2024-10-11 04:42:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521380114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:09,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:09,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165700614] [2024-10-11 04:42:09,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:09,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:09,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:09,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:09,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:09,698 INFO L87 Difference]: Start difference. First operand 1581 states and 2923 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:09,732 INFO L93 Difference]: Finished difference Result 1682 states and 3082 transitions. [2024-10-11 04:42:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-11 04:42:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:09,739 INFO L225 Difference]: With dead ends: 1682 [2024-10-11 04:42:09,740 INFO L226 Difference]: Without dead ends: 1626 [2024-10-11 04:42:09,741 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-10-11 04:42:09,744 INFO L432 NwaCegarLoop]: 1500 mSDtfsCounter, 1464 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:09,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1540 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-10-11 04:42:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1624. [2024-10-11 04:42:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.842786683107275) internal successors, (2989), 1623 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2989 transitions. [2024-10-11 04:42:09,783 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2989 transitions. Word has length 34 [2024-10-11 04:42:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:09,784 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2989 transitions. [2024-10-11 04:42:09,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2989 transitions. [2024-10-11 04:42:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:42:09,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:09,788 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] [2024-10-11 04:42:09,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:42:09,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:09,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash 163140984, now seen corresponding path program 1 times [2024-10-11 04:42:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:09,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458970149] [2024-10-11 04:42:09,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:09,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:09,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458970149] [2024-10-11 04:42:09,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458970149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:09,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:09,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:09,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187947994] [2024-10-11 04:42:09,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:09,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:09,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:09,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:09,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:09,956 INFO L87 Difference]: Start difference. First operand 1624 states and 2989 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:10,048 INFO L93 Difference]: Finished difference Result 1725 states and 3145 transitions. [2024-10-11 04:42:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:10,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-11 04:42:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:10,056 INFO L225 Difference]: With dead ends: 1725 [2024-10-11 04:42:10,056 INFO L226 Difference]: Without dead ends: 1626 [2024-10-11 04:42:10,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:42:10,060 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 4411 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:10,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 1579 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-10-11 04:42:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1624. [2024-10-11 04:42:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.841553637484587) internal successors, (2987), 1623 states have internal predecessors, (2987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2987 transitions. [2024-10-11 04:42:10,097 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2987 transitions. Word has length 34 [2024-10-11 04:42:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:10,098 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2987 transitions. [2024-10-11 04:42:10,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2987 transitions. [2024-10-11 04:42:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 04:42:10,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:10,101 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] [2024-10-11 04:42:10,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:42:10,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:10,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:10,102 INFO L85 PathProgramCache]: Analyzing trace with hash 634048377, now seen corresponding path program 1 times [2024-10-11 04:42:10,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:10,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483689483] [2024-10-11 04:42:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:10,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483689483] [2024-10-11 04:42:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483689483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:10,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:42:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337132436] [2024-10-11 04:42:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:10,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:42:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:42:10,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:42:10,251 INFO L87 Difference]: Start difference. First operand 1624 states and 2987 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:10,294 INFO L93 Difference]: Finished difference Result 1630 states and 2994 transitions. [2024-10-11 04:42:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:42:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-11 04:42:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:10,306 INFO L225 Difference]: With dead ends: 1630 [2024-10-11 04:42:10,306 INFO L226 Difference]: Without dead ends: 1628 [2024-10-11 04:42:10,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:42:10,309 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 0 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:10,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4495 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-10-11 04:42:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2024-10-11 04:42:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1626 states have (on average 1.8388683886838868) internal successors, (2990), 1627 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2990 transitions. [2024-10-11 04:42:10,346 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2990 transitions. Word has length 35 [2024-10-11 04:42:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:10,348 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2990 transitions. [2024-10-11 04:42:10,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2990 transitions. [2024-10-11 04:42:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:42:10,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:10,350 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] [2024-10-11 04:42:10,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:42:10,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:10,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1174229944, now seen corresponding path program 1 times [2024-10-11 04:42:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:10,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393051332] [2024-10-11 04:42:10,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:10,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:10,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393051332] [2024-10-11 04:42:10,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393051332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:10,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:10,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:10,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403692884] [2024-10-11 04:42:10,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:10,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:10,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:10,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:10,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:10,403 INFO L87 Difference]: Start difference. First operand 1628 states and 2990 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:10,438 INFO L93 Difference]: Finished difference Result 1742 states and 3163 transitions. [2024-10-11 04:42:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:10,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-11 04:42:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:10,445 INFO L225 Difference]: With dead ends: 1742 [2024-10-11 04:42:10,445 INFO L226 Difference]: Without dead ends: 1682 [2024-10-11 04:42:10,446 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-10-11 04:42:10,446 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 1474 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1578 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-10-11 04:42:10,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-10-11 04:42:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1680. [2024-10-11 04:42:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1678 states have (on average 1.82777115613826) internal successors, (3067), 1679 states have internal predecessors, (3067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 3067 transitions. [2024-10-11 04:42:10,481 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 3067 transitions. Word has length 36 [2024-10-11 04:42:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:10,482 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 3067 transitions. [2024-10-11 04:42:10,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 3067 transitions. [2024-10-11 04:42:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:42:10,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:10,483 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] [2024-10-11 04:42:10,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:42:10,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:10,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash 548573880, now seen corresponding path program 1 times [2024-10-11 04:42:10,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:10,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19762005] [2024-10-11 04:42:10,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:10,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:10,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19762005] [2024-10-11 04:42:10,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19762005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:10,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:10,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755188911] [2024-10-11 04:42:10,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:10,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:10,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:10,531 INFO L87 Difference]: Start difference. First operand 1680 states and 3067 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:10,564 INFO L93 Difference]: Finished difference Result 1962 states and 3487 transitions. [2024-10-11 04:42:10,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:10,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-11 04:42:10,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:10,571 INFO L225 Difference]: With dead ends: 1962 [2024-10-11 04:42:10,572 INFO L226 Difference]: Without dead ends: 1809 [2024-10-11 04:42:10,572 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-10-11 04:42:10,573 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1584 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-10-11 04:42:10,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-10-11 04:42:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1807. [2024-10-11 04:42:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1805 states have (on average 1.8) internal successors, (3249), 1806 states have internal predecessors, (3249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 3249 transitions. [2024-10-11 04:42:10,612 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 3249 transitions. Word has length 36 [2024-10-11 04:42:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:10,614 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 3249 transitions. [2024-10-11 04:42:10,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 3249 transitions. [2024-10-11 04:42:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:42:10,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:10,615 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] [2024-10-11 04:42:10,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:42:10,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:10,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:10,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1437307320, now seen corresponding path program 1 times [2024-10-11 04:42:10,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:10,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598161572] [2024-10-11 04:42:10,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:10,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:10,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598161572] [2024-10-11 04:42:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598161572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:10,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:10,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187096725] [2024-10-11 04:42:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:10,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:10,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:10,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:10,664 INFO L87 Difference]: Start difference. First operand 1807 states and 3249 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:10,708 INFO L93 Difference]: Finished difference Result 2319 states and 3991 transitions. [2024-10-11 04:42:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:10,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-11 04:42:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:10,716 INFO L225 Difference]: With dead ends: 2319 [2024-10-11 04:42:10,716 INFO L226 Difference]: Without dead ends: 2039 [2024-10-11 04:42:10,718 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-10-11 04:42:10,720 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 1470 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1586 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-10-11 04:42:10,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1586 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2024-10-11 04:42:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2037. [2024-10-11 04:42:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2035 states have (on average 1.7518427518427517) internal successors, (3565), 2036 states have internal predecessors, (3565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 3565 transitions. [2024-10-11 04:42:10,766 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 3565 transitions. Word has length 36 [2024-10-11 04:42:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:10,766 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 3565 transitions. [2024-10-11 04:42:10,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3565 transitions. [2024-10-11 04:42:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:42:10,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:10,768 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:42:10,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:42:10,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:10,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1394266792, now seen corresponding path program 1 times [2024-10-11 04:42:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435382278] [2024-10-11 04:42:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:10,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:42:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435382278] [2024-10-11 04:42:10,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435382278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:10,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:10,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:10,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559954278] [2024-10-11 04:42:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:10,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:10,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:10,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:10,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:10,923 INFO L87 Difference]: Start difference. First operand 2037 states and 3565 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-10-11 04:42:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:11,046 INFO L93 Difference]: Finished difference Result 3545 states and 5717 transitions. [2024-10-11 04:42:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:11,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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 50 [2024-10-11 04:42:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:11,058 INFO L225 Difference]: With dead ends: 3545 [2024-10-11 04:42:11,058 INFO L226 Difference]: Without dead ends: 3175 [2024-10-11 04:42:11,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:42:11,061 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 3031 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3031 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:11,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3031 Valid, 3153 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:42:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2024-10-11 04:42:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2477. [2024-10-11 04:42:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.690909090909091) internal successors, (4185), 2476 states have internal predecessors, (4185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 4185 transitions. [2024-10-11 04:42:11,130 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 4185 transitions. Word has length 50 [2024-10-11 04:42:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:11,131 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 4185 transitions. [2024-10-11 04:42:11,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-10-11 04:42:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 4185 transitions. [2024-10-11 04:42:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:42:11,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:11,132 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:42:11,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:42:11,132 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:11,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:11,133 INFO L85 PathProgramCache]: Analyzing trace with hash 768610728, now seen corresponding path program 1 times [2024-10-11 04:42:11,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:11,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545300149] [2024-10-11 04:42:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:11,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:42:11,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:11,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545300149] [2024-10-11 04:42:11,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545300149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:11,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:11,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354578351] [2024-10-11 04:42:11,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:11,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:11,261 INFO L87 Difference]: Start difference. First operand 2477 states and 4185 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:11,388 INFO L93 Difference]: Finished difference Result 4053 states and 6437 transitions. [2024-10-11 04:42:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:11,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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-10-11 04:42:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:11,403 INFO L225 Difference]: With dead ends: 4053 [2024-10-11 04:42:11,403 INFO L226 Difference]: Without dead ends: 3543 [2024-10-11 04:42:11,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:42:11,406 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 3035 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3035 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:11,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3035 Valid, 3130 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2024-10-11 04:42:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3169. [2024-10-11 04:42:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3169 states, 3167 states have (on average 1.6283549100094727) internal successors, (5157), 3168 states have internal predecessors, (5157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 5157 transitions. [2024-10-11 04:42:11,493 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 5157 transitions. Word has length 50 [2024-10-11 04:42:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:11,493 INFO L471 AbstractCegarLoop]: Abstraction has 3169 states and 5157 transitions. [2024-10-11 04:42:11,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 5157 transitions. [2024-10-11 04:42:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:42:11,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:11,494 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:42:11,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:42:11,495 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:11,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1657344168, now seen corresponding path program 1 times [2024-10-11 04:42:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:11,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590693374] [2024-10-11 04:42:11,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:11,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:42:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590693374] [2024-10-11 04:42:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590693374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271974606] [2024-10-11 04:42:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:11,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:11,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:11,652 INFO L87 Difference]: Start difference. First operand 3169 states and 5157 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:11,770 INFO L93 Difference]: Finished difference Result 4561 states and 7153 transitions. [2024-10-11 04:42:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:11,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-11 04:42:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:11,780 INFO L225 Difference]: With dead ends: 4561 [2024-10-11 04:42:11,781 INFO L226 Difference]: Without dead ends: 4051 [2024-10-11 04:42:11,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:42:11,783 INFO L432 NwaCegarLoop]: 1538 mSDtfsCounter, 3041 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:11,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3134 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2024-10-11 04:42:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 3677. [2024-10-11 04:42:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.598095238095238) internal successors, (5873), 3676 states have internal predecessors, (5873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5873 transitions. [2024-10-11 04:42:11,891 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5873 transitions. Word has length 50 [2024-10-11 04:42:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:11,891 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5873 transitions. [2024-10-11 04:42:11,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5873 transitions. [2024-10-11 04:42:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 04:42:11,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:11,892 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] [2024-10-11 04:42:11,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:42:11,893 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:11,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash 711524920, now seen corresponding path program 1 times [2024-10-11 04:42:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:11,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21957966] [2024-10-11 04:42:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21957966] [2024-10-11 04:42:11,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21957966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:11,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:11,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:11,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240626258] [2024-10-11 04:42:11,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:11,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:11,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:11,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:11,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:11,976 INFO L87 Difference]: Start difference. First operand 3677 states and 5873 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:12,051 INFO L93 Difference]: Finished difference Result 5829 states and 8911 transitions. [2024-10-11 04:42:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-11 04:42:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:12,059 INFO L225 Difference]: With dead ends: 5829 [2024-10-11 04:42:12,060 INFO L226 Difference]: Without dead ends: 3679 [2024-10-11 04:42:12,063 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-10-11 04:42:12,064 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 29 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:12,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3011 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2024-10-11 04:42:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3677. [2024-10-11 04:42:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.5844897959183672) internal successors, (5823), 3676 states have internal predecessors, (5823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5823 transitions. [2024-10-11 04:42:12,163 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5823 transitions. Word has length 51 [2024-10-11 04:42:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:12,163 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5823 transitions. [2024-10-11 04:42:12,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5823 transitions. [2024-10-11 04:42:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:42:12,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:12,164 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] [2024-10-11 04:42:12,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:42:12,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:12,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash -220010704, now seen corresponding path program 1 times [2024-10-11 04:42:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:12,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136940590] [2024-10-11 04:42:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:12,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:12,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136940590] [2024-10-11 04:42:12,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136940590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:12,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:12,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:12,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462064607] [2024-10-11 04:42:12,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:12,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:12,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:12,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:12,246 INFO L87 Difference]: Start difference. First operand 3677 states and 5823 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:12,292 INFO L93 Difference]: Finished difference Result 4523 states and 7010 transitions. [2024-10-11 04:42:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:12,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 04:42:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:12,298 INFO L225 Difference]: With dead ends: 4523 [2024-10-11 04:42:12,298 INFO L226 Difference]: Without dead ends: 2373 [2024-10-11 04:42:12,301 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-10-11 04:42:12,302 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 23 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:12,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3008 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2024-10-11 04:42:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2366. [2024-10-11 04:42:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2364 states have (on average 1.6912013536379018) internal successors, (3998), 2365 states have internal predecessors, (3998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3998 transitions. [2024-10-11 04:42:12,356 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3998 transitions. Word has length 52 [2024-10-11 04:42:12,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:12,356 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3998 transitions. [2024-10-11 04:42:12,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3998 transitions. [2024-10-11 04:42:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:42:12,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:12,357 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:42:12,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:42:12,358 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:12,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2127630598, now seen corresponding path program 1 times [2024-10-11 04:42:12,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:12,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489712687] [2024-10-11 04:42:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:12,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:12,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:12,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489712687] [2024-10-11 04:42:12,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489712687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:12,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:12,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:12,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284093582] [2024-10-11 04:42:12,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:12,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:12,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:12,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:12,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:12,439 INFO L87 Difference]: Start difference. First operand 2366 states and 3998 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:12,475 INFO L93 Difference]: Finished difference Result 2784 states and 4576 transitions. [2024-10-11 04:42:12,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:12,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-11 04:42:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:12,480 INFO L225 Difference]: With dead ends: 2784 [2024-10-11 04:42:12,480 INFO L226 Difference]: Without dead ends: 1954 [2024-10-11 04:42:12,481 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-10-11 04:42:12,482 INFO L432 NwaCegarLoop]: 1512 mSDtfsCounter, 25 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:12,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2987 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2024-10-11 04:42:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2024-10-11 04:42:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1950 states have (on average 1.7502564102564102) internal successors, (3413), 1951 states have internal predecessors, (3413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3413 transitions. [2024-10-11 04:42:12,526 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3413 transitions. Word has length 53 [2024-10-11 04:42:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:12,526 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 3413 transitions. [2024-10-11 04:42:12,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3413 transitions. [2024-10-11 04:42:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:42:12,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:12,527 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:42:12,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:42:12,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:12,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash -778516140, now seen corresponding path program 1 times [2024-10-11 04:42:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:12,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641659291] [2024-10-11 04:42:12,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:12,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:14,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:14,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641659291] [2024-10-11 04:42:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641659291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:14,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078311251] [2024-10-11 04:42:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:14,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:14,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:14,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:42:14,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:42:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:14,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 04:42:14,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:42:14,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:42:15,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078311251] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:15,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-11 04:42:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342141504] [2024-10-11 04:42:15,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:15,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 04:42:15,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 04:42:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 04:42:15,239 INFO L87 Difference]: Start difference. First operand 1952 states and 3413 transitions. Second operand has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:17,260 INFO L93 Difference]: Finished difference Result 3941 states and 6055 transitions. [2024-10-11 04:42:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 04:42:17,260 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 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 55 [2024-10-11 04:42:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:17,267 INFO L225 Difference]: With dead ends: 3941 [2024-10-11 04:42:17,267 INFO L226 Difference]: Without dead ends: 3525 [2024-10-11 04:42:17,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=522, Invalid=2130, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 04:42:17,270 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 14282 mSDsluCounter, 6159 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14282 SdHoareTripleChecker+Valid, 7650 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:17,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14282 Valid, 7650 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:42:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2024-10-11 04:42:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3423. [2024-10-11 04:42:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 3421 states have (on average 1.5396083016661795) internal successors, (5267), 3422 states have internal predecessors, (5267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 5267 transitions. [2024-10-11 04:42:17,363 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 5267 transitions. Word has length 55 [2024-10-11 04:42:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:17,363 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 5267 transitions. [2024-10-11 04:42:17,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 5267 transitions. [2024-10-11 04:42:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:42:17,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:17,365 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:42:17,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:42:17,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 04:42:17,566 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:17,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1880919838, now seen corresponding path program 1 times [2024-10-11 04:42:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393645532] [2024-10-11 04:42:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:17,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393645532] [2024-10-11 04:42:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393645532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364811680] [2024-10-11 04:42:17,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:17,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:17,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:17,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:42:17,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:42:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:18,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:42:18,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:18,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:19,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364811680] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:19,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:19,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-11 04:42:19,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905528323] [2024-10-11 04:42:19,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:19,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 04:42:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:19,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 04:42:19,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-10-11 04:42:19,182 INFO L87 Difference]: Start difference. First operand 3423 states and 5267 transitions. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:19,699 INFO L93 Difference]: Finished difference Result 6546 states and 9293 transitions. [2024-10-11 04:42:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 04:42:19,700 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 0 states have call successors, (0), 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 56 [2024-10-11 04:42:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:19,709 INFO L225 Difference]: With dead ends: 6546 [2024-10-11 04:42:19,709 INFO L226 Difference]: Without dead ends: 4967 [2024-10-11 04:42:19,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2024-10-11 04:42:19,713 INFO L432 NwaCegarLoop]: 1485 mSDtfsCounter, 11915 mSDsluCounter, 4621 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11915 SdHoareTripleChecker+Valid, 6106 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:19,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11915 Valid, 6106 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:42:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4967 states. [2024-10-11 04:42:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 4963. [2024-10-11 04:42:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4963 states, 4961 states have (on average 1.4557548881273936) internal successors, (7222), 4962 states have internal predecessors, (7222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4963 states to 4963 states and 7222 transitions. [2024-10-11 04:42:19,862 INFO L78 Accepts]: Start accepts. Automaton has 4963 states and 7222 transitions. Word has length 56 [2024-10-11 04:42:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:19,862 INFO L471 AbstractCegarLoop]: Abstraction has 4963 states and 7222 transitions. [2024-10-11 04:42:19,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4963 states and 7222 transitions. [2024-10-11 04:42:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:42:19,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:19,865 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:42:19,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:42:20,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 04:42:20,070 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:20,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:20,070 INFO L85 PathProgramCache]: Analyzing trace with hash 444638178, now seen corresponding path program 1 times [2024-10-11 04:42:20,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:20,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854528813] [2024-10-11 04:42:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:20,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:20,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:20,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854528813] [2024-10-11 04:42:20,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854528813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:20,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157014033] [2024-10-11 04:42:20,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:20,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:20,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:20,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:42:20,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:42:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:20,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 04:42:20,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:23,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:25,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157014033] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:25,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 19] total 44 [2024-10-11 04:42:25,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902035114] [2024-10-11 04:42:25,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:25,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-11 04:42:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:25,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-11 04:42:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 04:42:25,880 INFO L87 Difference]: Start difference. First operand 4963 states and 7222 transitions. Second operand has 44 states, 44 states have (on average 3.3863636363636362) internal successors, (149), 44 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:33,473 INFO L93 Difference]: Finished difference Result 13317 states and 17984 transitions. [2024-10-11 04:42:33,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-10-11 04:42:33,474 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.3863636363636362) internal successors, (149), 44 states have internal predecessors, (149), 0 states have call successors, (0), 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 56 [2024-10-11 04:42:33,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:33,493 INFO L225 Difference]: With dead ends: 13317 [2024-10-11 04:42:33,493 INFO L226 Difference]: Without dead ends: 10174 [2024-10-11 04:42:33,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4481 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2836, Invalid=11206, Unknown=0, NotChecked=0, Total=14042 [2024-10-11 04:42:33,505 INFO L432 NwaCegarLoop]: 1516 mSDtfsCounter, 14552 mSDsluCounter, 17161 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14552 SdHoareTripleChecker+Valid, 18677 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:33,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14552 Valid, 18677 Invalid, 1766 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:42:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10174 states. [2024-10-11 04:42:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10174 to 4581. [2024-10-11 04:42:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 4579 states have (on average 1.4601441362742957) internal successors, (6686), 4580 states have internal predecessors, (6686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 6686 transitions. [2024-10-11 04:42:33,691 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 6686 transitions. Word has length 56 [2024-10-11 04:42:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:33,692 INFO L471 AbstractCegarLoop]: Abstraction has 4581 states and 6686 transitions. [2024-10-11 04:42:33,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.3863636363636362) internal successors, (149), 44 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 6686 transitions. [2024-10-11 04:42:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:42:33,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:33,693 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:42:33,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 04:42:33,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:33,894 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:33,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1749166596, now seen corresponding path program 1 times [2024-10-11 04:42:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:33,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879712575] [2024-10-11 04:42:33,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:33,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:34,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:34,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879712575] [2024-10-11 04:42:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879712575] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:34,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917792675] [2024-10-11 04:42:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:34,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:34,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:34,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:42:34,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:42:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:34,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 04:42:34,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:34,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:35,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917792675] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:35,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:35,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2024-10-11 04:42:35,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645340148] [2024-10-11 04:42:35,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:35,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 04:42:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:35,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 04:42:35,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2024-10-11 04:42:35,494 INFO L87 Difference]: Start difference. First operand 4581 states and 6686 transitions. Second operand has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:36,134 INFO L93 Difference]: Finished difference Result 10199 states and 13854 transitions. [2024-10-11 04:42:36,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 04:42:36,135 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 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 57 [2024-10-11 04:42:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:36,150 INFO L225 Difference]: With dead ends: 10199 [2024-10-11 04:42:36,150 INFO L226 Difference]: Without dead ends: 7383 [2024-10-11 04:42:36,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=472, Invalid=1508, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 04:42:36,158 INFO L432 NwaCegarLoop]: 1488 mSDtfsCounter, 16505 mSDsluCounter, 6127 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16505 SdHoareTripleChecker+Valid, 7615 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:36,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16505 Valid, 7615 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:42:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2024-10-11 04:42:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 7283. [2024-10-11 04:42:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7283 states, 7281 states have (on average 1.3717895893421233) internal successors, (9988), 7282 states have internal predecessors, (9988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 9988 transitions. [2024-10-11 04:42:36,413 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 9988 transitions. Word has length 57 [2024-10-11 04:42:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:36,413 INFO L471 AbstractCegarLoop]: Abstraction has 7283 states and 9988 transitions. [2024-10-11 04:42:36,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 9988 transitions. [2024-10-11 04:42:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:42:36,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:36,414 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:42:36,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 04:42:36,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:36,619 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:36,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:36,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1901719096, now seen corresponding path program 1 times [2024-10-11 04:42:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:36,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672238618] [2024-10-11 04:42:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:36,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:37,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672238618] [2024-10-11 04:42:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672238618] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510509318] [2024-10-11 04:42:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:37,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:37,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:37,477 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:42:37,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:42:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:37,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 04:42:37,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:39,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:42,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510509318] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:42,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:42,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 51 [2024-10-11 04:42:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112214718] [2024-10-11 04:42:42,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:42,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-11 04:42:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:42,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-11 04:42:42,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2273, Unknown=0, NotChecked=0, Total=2550 [2024-10-11 04:42:42,410 INFO L87 Difference]: Start difference. First operand 7283 states and 9988 transitions. Second operand has 51 states, 51 states have (on average 3.0784313725490198) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:00,827 INFO L93 Difference]: Finished difference Result 14218 states and 18684 transitions. [2024-10-11 04:43:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-10-11 04:43:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.0784313725490198) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 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 58 [2024-10-11 04:43:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:00,851 INFO L225 Difference]: With dead ends: 14218 [2024-10-11 04:43:00,851 INFO L226 Difference]: Without dead ends: 10827 [2024-10-11 04:43:00,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6692 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=4339, Invalid=16831, Unknown=0, NotChecked=0, Total=21170 [2024-10-11 04:43:00,865 INFO L432 NwaCegarLoop]: 1511 mSDtfsCounter, 19495 mSDsluCounter, 25844 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19495 SdHoareTripleChecker+Valid, 27355 SdHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:00,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19495 Valid, 27355 Invalid, 1939 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [110 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:43:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10827 states. [2024-10-11 04:43:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10827 to 8946. [2024-10-11 04:43:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8946 states, 8944 states have (on average 1.3492844364937389) internal successors, (12068), 8945 states have internal predecessors, (12068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8946 states to 8946 states and 12068 transitions. [2024-10-11 04:43:01,392 INFO L78 Accepts]: Start accepts. Automaton has 8946 states and 12068 transitions. Word has length 58 [2024-10-11 04:43:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:01,392 INFO L471 AbstractCegarLoop]: Abstraction has 8946 states and 12068 transitions. [2024-10-11 04:43:01,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.0784313725490198) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 8946 states and 12068 transitions. [2024-10-11 04:43:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 04:43:01,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:01,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:01,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 04:43:01,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:01,598 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:01,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:01,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1927582574, now seen corresponding path program 1 times [2024-10-11 04:43:01,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:01,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938908577] [2024-10-11 04:43:01,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:01,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938908577] [2024-10-11 04:43:01,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938908577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:01,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:01,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:01,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488951708] [2024-10-11 04:43:01,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:01,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:43:01,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:01,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:43:01,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:43:01,752 INFO L87 Difference]: Start difference. First operand 8946 states and 12068 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:06,959 INFO L93 Difference]: Finished difference Result 12703 states and 19066 transitions. [2024-10-11 04:43:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:43:06,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-11 04:43:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:06,977 INFO L225 Difference]: With dead ends: 12703 [2024-10-11 04:43:06,978 INFO L226 Difference]: Without dead ends: 11199 [2024-10-11 04:43:06,984 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-10-11 04:43:06,986 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 2282 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4791 mSolverCounterSat, 1179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2282 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 5970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1179 IncrementalHoareTripleChecker+Valid, 4791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:06,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2282 Valid, 777 Invalid, 5970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1179 Valid, 4791 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 04:43:06,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11199 states. [2024-10-11 04:43:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11199 to 11199. [2024-10-11 04:43:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11199 states, 11197 states have (on average 1.3090113423238368) internal successors, (14657), 11198 states have internal predecessors, (14657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11199 states to 11199 states and 14657 transitions. [2024-10-11 04:43:07,420 INFO L78 Accepts]: Start accepts. Automaton has 11199 states and 14657 transitions. Word has length 79 [2024-10-11 04:43:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:07,421 INFO L471 AbstractCegarLoop]: Abstraction has 11199 states and 14657 transitions. [2024-10-11 04:43:07,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 11199 states and 14657 transitions. [2024-10-11 04:43:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 04:43:07,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:07,423 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 04:43:07,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 04:43:07,424 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:07,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1257221760, now seen corresponding path program 1 times [2024-10-11 04:43:07,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:07,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659086222] [2024-10-11 04:43:07,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:07,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:08,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:08,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659086222] [2024-10-11 04:43:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659086222] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:08,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696870867] [2024-10-11 04:43:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:08,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:08,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:08,074 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:43:08,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 04:43:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:08,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 04:43:08,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:08,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 31 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:10,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696870867] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:10,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:10,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2024-10-11 04:43:10,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238703838] [2024-10-11 04:43:10,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:10,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 04:43:10,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:10,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 04:43:10,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:43:10,600 INFO L87 Difference]: Start difference. First operand 11199 states and 14657 transitions. Second operand has 32 states, 32 states have (on average 8.03125) internal successors, (257), 32 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)