./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 355322de5dcfb8cbd44ad690b6b14768d5a2fa38ff5dfd1ede94c260e278eb8b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:50:35,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:50:35,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:50:35,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:50:35,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:50:35,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:50:35,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:50:35,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:50:35,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:50:35,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:50:35,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:50:35,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:50:35,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:50:35,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:50:35,768 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:50:35,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:50:35,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:50:35,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:50:35,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:50:35,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:50:35,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:50:35,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:50:35,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:50:35,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:50:35,773 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:50:35,773 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:50:35,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:50:35,774 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:50:35,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:50:35,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:50:35,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:50:35,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:50:35,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:50:35,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:50:35,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:50:35,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:50:35,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:50:35,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:50:35,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:50:35,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:50:35,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:50:35,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:50:35,776 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 355322de5dcfb8cbd44ad690b6b14768d5a2fa38ff5dfd1ede94c260e278eb8b [2024-11-10 00:50:36,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:50:36,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:50:36,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:50:36,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:50:36,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:50:36,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c [2024-11-10 00:50:37,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:50:37,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:50:37,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c [2024-11-10 00:50:37,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f68a470d6/c839e72ed2e34e0087c379c9032194c8/FLAG63041d35d [2024-11-10 00:50:37,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f68a470d6/c839e72ed2e34e0087c379c9032194c8 [2024-11-10 00:50:37,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:50:37,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:50:37,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:50:37,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:50:37,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:50:37,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:50:37" (1/1) ... [2024-11-10 00:50:37,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7682cb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:37, skipping insertion in model container [2024-11-10 00:50:37,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:50:37" (1/1) ... [2024-11-10 00:50:37,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:50:38,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[8616,8629] [2024-11-10 00:50:38,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[10953,10966] [2024-11-10 00:50:38,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:50:38,763 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:50:38,798 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[8616,8629] [2024-11-10 00:50:38,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[10953,10966] [2024-11-10 00:50:39,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:50:39,060 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:50:39,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39 WrapperNode [2024-11-10 00:50:39,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:50:39,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:50:39,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:50:39,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:50:39,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,287 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5037 [2024-11-10 00:50:39,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:50:39,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:50:39,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:50:39,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:50:39,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,503 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:50:39,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:50:39,691 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:50:39,691 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:50:39,691 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:50:39,692 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (1/1) ... [2024-11-10 00:50:39,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:50:39,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:39,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:50:39,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:50:39,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:50:39,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:50:39,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:50:39,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:50:39,821 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:50:39,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:50:43,653 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5020: havoc calculate_output3_#t~ret36#1; [2024-11-10 00:50:43,653 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2051: havoc calculate_output_#t~ret34#1; [2024-11-10 00:50:43,653 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3530: havoc calculate_output2_#t~ret35#1; [2024-11-10 00:50:43,830 INFO L? ?]: Removed 2074 outVars from TransFormulas that were not future-live. [2024-11-10 00:50:43,830 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:50:43,853 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:50:43,853 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:50:43,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:50:43 BoogieIcfgContainer [2024-11-10 00:50:43,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:50:43,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:50:43,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:50:43,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:50:43,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:50:37" (1/3) ... [2024-11-10 00:50:43,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c192d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:50:43, skipping insertion in model container [2024-11-10 00:50:43,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:39" (2/3) ... [2024-11-10 00:50:43,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c192d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:50:43, skipping insertion in model container [2024-11-10 00:50:43,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:50:43" (3/3) ... [2024-11-10 00:50:43,862 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c [2024-11-10 00:50:43,874 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:50:43,875 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:50:43,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:50:43,943 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;@65236b98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:50:43,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:50:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 892 states, 889 states have (on average 2.6636670416197976) internal successors, (2368), 891 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:50:43,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:43,961 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] [2024-11-10 00:50:43,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1707679581, now seen corresponding path program 1 times [2024-11-10 00:50:43,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:43,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16270344] [2024-11-10 00:50:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:44,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:44,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16270344] [2024-11-10 00:50:44,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16270344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:44,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:44,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:50:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300098231] [2024-11-10 00:50:44,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:44,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:44,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:44,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:44,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:44,219 INFO L87 Difference]: Start difference. First operand has 892 states, 889 states have (on average 2.6636670416197976) internal successors, (2368), 891 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:48,136 INFO L93 Difference]: Finished difference Result 2525 states and 6879 transitions. [2024-11-10 00:50:48,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:48,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-10 00:50:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:48,162 INFO L225 Difference]: With dead ends: 2525 [2024-11-10 00:50:48,162 INFO L226 Difference]: Without dead ends: 1576 [2024-11-10 00:50:48,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:48,173 INFO L432 NwaCegarLoop]: 633 mSDtfsCounter, 1596 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:48,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 646 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-10 00:50:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-10 00:50:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2024-11-10 00:50:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1574 states have (on average 2.4733163913595932) internal successors, (3893), 1575 states have internal predecessors, (3893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3893 transitions. [2024-11-10 00:50:48,273 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 3893 transitions. Word has length 22 [2024-11-10 00:50:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:48,273 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 3893 transitions. [2024-11-10 00:50:48,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 3893 transitions. [2024-11-10 00:50:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:50:48,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:48,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:48,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:50:48,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:48,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1573097597, now seen corresponding path program 1 times [2024-11-10 00:50:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960422856] [2024-11-10 00:50:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:48,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-11-10 00:50:48,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:48,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960422856] [2024-11-10 00:50:48,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960422856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:48,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:48,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:50:48,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480113947] [2024-11-10 00:50:48,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:48,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:50:48,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:48,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:50:48,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:50:48,403 INFO L87 Difference]: Start difference. First operand 1576 states and 3893 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:48,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:48,460 INFO L93 Difference]: Finished difference Result 1658 states and 4017 transitions. [2024-11-10 00:50:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:50:48,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 00:50:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:48,469 INFO L225 Difference]: With dead ends: 1658 [2024-11-10 00:50:48,469 INFO L226 Difference]: Without dead ends: 1615 [2024-11-10 00:50:48,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:50:48,471 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 59 mSDsluCounter, 6658 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 8887 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:48,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 8887 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-10 00:50:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1576. [2024-11-10 00:50:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1574 states have (on average 2.4587039390088945) internal successors, (3870), 1575 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3870 transitions. [2024-11-10 00:50:48,493 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 3870 transitions. Word has length 24 [2024-11-10 00:50:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:48,493 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 3870 transitions. [2024-11-10 00:50:48,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 3870 transitions. [2024-11-10 00:50:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 00:50:48,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:48,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:48,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:50:48,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:48,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:48,495 INFO L85 PathProgramCache]: Analyzing trace with hash 67352845, now seen corresponding path program 1 times [2024-11-10 00:50:48,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:48,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088001881] [2024-11-10 00:50:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:48,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088001881] [2024-11-10 00:50:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088001881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:48,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:48,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211691262] [2024-11-10 00:50:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:48,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:48,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:48,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:48,645 INFO L87 Difference]: Start difference. First operand 1576 states and 3870 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:48,781 INFO L93 Difference]: Finished difference Result 1888 states and 4350 transitions. [2024-11-10 00:50:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:50:48,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-10 00:50:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:48,788 INFO L225 Difference]: With dead ends: 1888 [2024-11-10 00:50:48,788 INFO L226 Difference]: Without dead ends: 1849 [2024-11-10 00:50:48,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:50:48,791 INFO L432 NwaCegarLoop]: 2206 mSDtfsCounter, 8967 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8967 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:48,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8967 Valid, 3042 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:50:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2024-11-10 00:50:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1612. [2024-11-10 00:50:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1610 states have (on average 2.4385093167701863) internal successors, (3926), 1611 states have internal predecessors, (3926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 3926 transitions. [2024-11-10 00:50:48,822 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 3926 transitions. Word has length 46 [2024-11-10 00:50:48,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:48,823 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 3926 transitions. [2024-11-10 00:50:48,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 3926 transitions. [2024-11-10 00:50:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 00:50:48,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:48,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:48,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:50:48,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:48,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1704032145, now seen corresponding path program 1 times [2024-11-10 00:50:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:48,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485610200] [2024-11-10 00:50:48,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:48,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:49,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485610200] [2024-11-10 00:50:49,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485610200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:49,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:49,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:49,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620792] [2024-11-10 00:50:49,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:49,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:49,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:49,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:49,057 INFO L87 Difference]: Start difference. First operand 1612 states and 3926 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:49,151 INFO L93 Difference]: Finished difference Result 1690 states and 4044 transitions. [2024-11-10 00:50:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:50:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-10 00:50:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:49,158 INFO L225 Difference]: With dead ends: 1690 [2024-11-10 00:50:49,158 INFO L226 Difference]: Without dead ends: 1615 [2024-11-10 00:50:49,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:50:49,163 INFO L432 NwaCegarLoop]: 2204 mSDtfsCounter, 8660 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8660 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:49,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8660 Valid, 2372 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-10 00:50:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1612. [2024-11-10 00:50:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1610 states have (on average 2.437888198757764) internal successors, (3925), 1611 states have internal predecessors, (3925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 3925 transitions. [2024-11-10 00:50:49,190 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 3925 transitions. Word has length 48 [2024-11-10 00:50:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:49,190 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 3925 transitions. [2024-11-10 00:50:49,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 3925 transitions. [2024-11-10 00:50:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 00:50:49,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:49,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:49,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:50:49,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:49,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash 438430262, now seen corresponding path program 1 times [2024-11-10 00:50:49,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:49,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067067791] [2024-11-10 00:50:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:49,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:49,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:49,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067067791] [2024-11-10 00:50:49,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067067791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:49,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:49,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:49,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547771297] [2024-11-10 00:50:49,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:49,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:49,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:49,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:49,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:49,256 INFO L87 Difference]: Start difference. First operand 1612 states and 3925 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:49,280 INFO L93 Difference]: Finished difference Result 1750 states and 4135 transitions. [2024-11-10 00:50:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:49,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-10 00:50:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:49,288 INFO L225 Difference]: With dead ends: 1750 [2024-11-10 00:50:49,288 INFO L226 Difference]: Without dead ends: 1675 [2024-11-10 00:50:49,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:49,291 INFO L432 NwaCegarLoop]: 2216 mSDtfsCounter, 2158 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:49,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2271 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2024-11-10 00:50:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1672. [2024-11-10 00:50:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1670 states have (on average 2.404191616766467) internal successors, (4015), 1671 states have internal predecessors, (4015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 4015 transitions. [2024-11-10 00:50:49,318 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 4015 transitions. Word has length 49 [2024-11-10 00:50:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:49,319 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 4015 transitions. [2024-11-10 00:50:49,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 4015 transitions. [2024-11-10 00:50:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:50:49,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:49,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:49,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:50:49,320 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:49,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:49,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1147349681, now seen corresponding path program 1 times [2024-11-10 00:50:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:49,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613822250] [2024-11-10 00:50:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:49,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:49,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:49,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613822250] [2024-11-10 00:50:49,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613822250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:49,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:49,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:49,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746715500] [2024-11-10 00:50:49,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:49,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:49,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:49,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:49,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:49,370 INFO L87 Difference]: Start difference. First operand 1672 states and 4015 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:49,398 INFO L93 Difference]: Finished difference Result 1817 states and 4235 transitions. [2024-11-10 00:50:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:49,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:50:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:49,406 INFO L225 Difference]: With dead ends: 1817 [2024-11-10 00:50:49,406 INFO L226 Difference]: Without dead ends: 1742 [2024-11-10 00:50:49,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:49,408 INFO L432 NwaCegarLoop]: 2254 mSDtfsCounter, 2170 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:49,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2315 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2024-11-10 00:50:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1739. [2024-11-10 00:50:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1737 states have (on average 2.369027058146229) internal successors, (4115), 1738 states have internal predecessors, (4115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4115 transitions. [2024-11-10 00:50:49,435 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 4115 transitions. Word has length 50 [2024-11-10 00:50:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:49,436 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 4115 transitions. [2024-11-10 00:50:49,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 4115 transitions. [2024-11-10 00:50:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:50:49,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:49,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:49,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:50:49,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:49,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:49,438 INFO L85 PathProgramCache]: Analyzing trace with hash 145939953, now seen corresponding path program 1 times [2024-11-10 00:50:49,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:49,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496251907] [2024-11-10 00:50:49,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:49,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496251907] [2024-11-10 00:50:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496251907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:49,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:49,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483509402] [2024-11-10 00:50:49,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:49,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:49,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:49,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:49,492 INFO L87 Difference]: Start difference. First operand 1739 states and 4115 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:49,543 INFO L93 Difference]: Finished difference Result 2113 states and 4677 transitions. [2024-11-10 00:50:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:49,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:50:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:49,549 INFO L225 Difference]: With dead ends: 2113 [2024-11-10 00:50:49,549 INFO L226 Difference]: Without dead ends: 1914 [2024-11-10 00:50:49,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:49,550 INFO L432 NwaCegarLoop]: 2256 mSDtfsCounter, 2168 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:49,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 2321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2024-11-10 00:50:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1911. [2024-11-10 00:50:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1909 states have (on average 2.2875851231011) internal successors, (4367), 1910 states have internal predecessors, (4367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 4367 transitions. [2024-11-10 00:50:49,582 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 4367 transitions. Word has length 50 [2024-11-10 00:50:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:49,582 INFO L471 AbstractCegarLoop]: Abstraction has 1911 states and 4367 transitions. [2024-11-10 00:50:49,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 4367 transitions. [2024-11-10 00:50:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:50:49,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:49,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:49,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:50:49,583 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:49,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash 131490097, now seen corresponding path program 1 times [2024-11-10 00:50:49,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:49,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301032494] [2024-11-10 00:50:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:49,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:49,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301032494] [2024-11-10 00:50:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301032494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:49,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:49,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:49,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96444627] [2024-11-10 00:50:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:49,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:49,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:49,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:49,646 INFO L87 Difference]: Start difference. First operand 1911 states and 4367 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:49,674 INFO L93 Difference]: Finished difference Result 2605 states and 5391 transitions. [2024-11-10 00:50:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:49,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:50:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:49,682 INFO L225 Difference]: With dead ends: 2605 [2024-11-10 00:50:49,682 INFO L226 Difference]: Without dead ends: 2234 [2024-11-10 00:50:49,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:49,684 INFO L432 NwaCegarLoop]: 2254 mSDtfsCounter, 2166 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:49,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 2323 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:49,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2024-11-10 00:50:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2231. [2024-11-10 00:50:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2229 states have (on average 2.163750560789592) internal successors, (4823), 2230 states have internal predecessors, (4823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 4823 transitions. [2024-11-10 00:50:49,729 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 4823 transitions. Word has length 50 [2024-11-10 00:50:49,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:49,729 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 4823 transitions. [2024-11-10 00:50:49,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 4823 transitions. [2024-11-10 00:50:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:50:49,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:49,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:49,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:50:49,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:49,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2071874447, now seen corresponding path program 1 times [2024-11-10 00:50:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:49,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810793418] [2024-11-10 00:50:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:49,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:49,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:49,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810793418] [2024-11-10 00:50:49,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810793418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:49,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:49,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545450776] [2024-11-10 00:50:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:49,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:49,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:49,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:49,783 INFO L87 Difference]: Start difference. First operand 2231 states and 4823 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:49,818 INFO L93 Difference]: Finished difference Result 3517 states and 6675 transitions. [2024-11-10 00:50:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:49,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:50:49,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:49,827 INFO L225 Difference]: With dead ends: 3517 [2024-11-10 00:50:49,827 INFO L226 Difference]: Without dead ends: 2826 [2024-11-10 00:50:49,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:49,829 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 2164 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:49,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 2325 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2024-11-10 00:50:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2823. [2024-11-10 00:50:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2821 states have (on average 1.998936547323644) internal successors, (5639), 2822 states have internal predecessors, (5639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 5639 transitions. [2024-11-10 00:50:49,878 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 5639 transitions. Word has length 50 [2024-11-10 00:50:49,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:49,879 INFO L471 AbstractCegarLoop]: Abstraction has 2823 states and 5639 transitions. [2024-11-10 00:50:49,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 5639 transitions. [2024-11-10 00:50:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:50:49,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:49,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:49,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:50:49,880 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:49,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1698815794, now seen corresponding path program 1 times [2024-11-10 00:50:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:49,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203516496] [2024-11-10 00:50:49,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:49,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203516496] [2024-11-10 00:50:49,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203516496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:49,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:49,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:50:49,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454514511] [2024-11-10 00:50:49,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:49,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:50:49,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:50:50,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:50:50,000 INFO L87 Difference]: Start difference. First operand 2823 states and 5639 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:50,048 INFO L93 Difference]: Finished difference Result 2922 states and 5769 transitions. [2024-11-10 00:50:50,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:50:50,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:50:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:50,057 INFO L225 Difference]: With dead ends: 2922 [2024-11-10 00:50:50,058 INFO L226 Difference]: Without dead ends: 2919 [2024-11-10 00:50:50,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:50:50,059 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 0 mSDsluCounter, 6612 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8819 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:50,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8819 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2024-11-10 00:50:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2919. [2024-11-10 00:50:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2917 states have (on average 1.9633184778882413) internal successors, (5727), 2918 states have internal predecessors, (5727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 5727 transitions. [2024-11-10 00:50:50,107 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 5727 transitions. Word has length 50 [2024-11-10 00:50:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:50,108 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 5727 transitions. [2024-11-10 00:50:50,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 5727 transitions. [2024-11-10 00:50:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:50:50,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:50,109 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:50,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:50:50,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:50,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash -26766179, now seen corresponding path program 1 times [2024-11-10 00:50:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:50,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948093774] [2024-11-10 00:50:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:50:50,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:50,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948093774] [2024-11-10 00:50:50,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948093774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:50,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:50,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:50,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529707409] [2024-11-10 00:50:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:50,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:50,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:50,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:50,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:50,213 INFO L87 Difference]: Start difference. First operand 2919 states and 5727 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:50,416 INFO L93 Difference]: Finished difference Result 8366 states and 13273 transitions. [2024-11-10 00:50:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:50:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:50:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:50,433 INFO L225 Difference]: With dead ends: 8366 [2024-11-10 00:50:50,436 INFO L226 Difference]: Without dead ends: 7371 [2024-11-10 00:50:50,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:50:50,439 INFO L432 NwaCegarLoop]: 2265 mSDtfsCounter, 6705 mSDsluCounter, 2518 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6705 SdHoareTripleChecker+Valid, 4783 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:50,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6705 Valid, 4783 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:50:50,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7371 states. [2024-11-10 00:50:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7371 to 4111. [2024-11-10 00:50:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4111 states, 4109 states have (on average 1.7909467023606718) internal successors, (7359), 4110 states have internal predecessors, (7359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 7359 transitions. [2024-11-10 00:50:50,522 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 7359 transitions. Word has length 69 [2024-11-10 00:50:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:50,522 INFO L471 AbstractCegarLoop]: Abstraction has 4111 states and 7359 transitions. [2024-11-10 00:50:50,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 7359 transitions. [2024-11-10 00:50:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:50:50,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:50,524 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:50,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:50:50,524 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:50,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1028175907, now seen corresponding path program 1 times [2024-11-10 00:50:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:50,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899149141] [2024-11-10 00:50:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:50,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:50:50,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:50,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899149141] [2024-11-10 00:50:50,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899149141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:50,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:50,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191520902] [2024-11-10 00:50:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:50,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:50,622 INFO L87 Difference]: Start difference. First operand 4111 states and 7359 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:50,776 INFO L93 Difference]: Finished difference Result 9742 states and 15169 transitions. [2024-11-10 00:50:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:50:50,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:50:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:50,791 INFO L225 Difference]: With dead ends: 9742 [2024-11-10 00:50:50,791 INFO L226 Difference]: Without dead ends: 8363 [2024-11-10 00:50:50,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:50:50,796 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 6707 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6707 SdHoareTripleChecker+Valid, 4757 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:50,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6707 Valid, 4757 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:50:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8363 states. [2024-11-10 00:50:50,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8363 to 5983. [2024-11-10 00:50:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5981 states have (on average 1.6584183246948672) internal successors, (9919), 5982 states have internal predecessors, (9919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 9919 transitions. [2024-11-10 00:50:50,917 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 9919 transitions. Word has length 69 [2024-11-10 00:50:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:50,917 INFO L471 AbstractCegarLoop]: Abstraction has 5983 states and 9919 transitions. [2024-11-10 00:50:50,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 9919 transitions. [2024-11-10 00:50:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:50:50,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:50,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:50,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:50:50,919 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:50,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1042625763, now seen corresponding path program 1 times [2024-11-10 00:50:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:50,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533742558] [2024-11-10 00:50:50,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:50:51,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533742558] [2024-11-10 00:50:51,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533742558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:51,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:51,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:51,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526516244] [2024-11-10 00:50:51,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:51,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:51,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:51,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:51,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:51,004 INFO L87 Difference]: Start difference. First operand 5983 states and 9919 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:51,236 INFO L93 Difference]: Finished difference Result 11118 states and 17057 transitions. [2024-11-10 00:50:51,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:50:51,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:50:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:51,252 INFO L225 Difference]: With dead ends: 11118 [2024-11-10 00:50:51,252 INFO L226 Difference]: Without dead ends: 9739 [2024-11-10 00:50:51,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:50:51,257 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 6733 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6733 SdHoareTripleChecker+Valid, 4724 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:51,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6733 Valid, 4724 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2024-11-10 00:50:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 7359. [2024-11-10 00:50:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7359 states, 7357 states have (on average 1.6048661139051243) internal successors, (11807), 7358 states have internal predecessors, (11807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7359 states to 7359 states and 11807 transitions. [2024-11-10 00:50:51,458 INFO L78 Accepts]: Start accepts. Automaton has 7359 states and 11807 transitions. Word has length 69 [2024-11-10 00:50:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:51,458 INFO L471 AbstractCegarLoop]: Abstraction has 7359 states and 11807 transitions. [2024-11-10 00:50:51,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7359 states and 11807 transitions. [2024-11-10 00:50:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:50:51,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:51,460 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:51,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:50:51,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:51,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1048976989, now seen corresponding path program 1 times [2024-11-10 00:50:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:51,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246148557] [2024-11-10 00:50:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:50:51,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:51,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246148557] [2024-11-10 00:50:51,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246148557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:51,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:51,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:51,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855150575] [2024-11-10 00:50:51,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:51,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:51,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:51,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:51,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:51,574 INFO L87 Difference]: Start difference. First operand 7359 states and 11807 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:51,779 INFO L93 Difference]: Finished difference Result 12494 states and 18945 transitions. [2024-11-10 00:50:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:50:51,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:50:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:51,795 INFO L225 Difference]: With dead ends: 12494 [2024-11-10 00:50:51,795 INFO L226 Difference]: Without dead ends: 11115 [2024-11-10 00:50:51,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:50:51,800 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 6721 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6721 SdHoareTripleChecker+Valid, 4764 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:51,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6721 Valid, 4764 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:50:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11115 states. [2024-11-10 00:50:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11115 to 8735. [2024-11-10 00:50:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8735 states, 8733 states have (on average 1.5681896255582275) internal successors, (13695), 8734 states have internal predecessors, (13695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 13695 transitions. [2024-11-10 00:50:51,958 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 13695 transitions. Word has length 69 [2024-11-10 00:50:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:51,958 INFO L471 AbstractCegarLoop]: Abstraction has 8735 states and 13695 transitions. [2024-11-10 00:50:51,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 13695 transitions. [2024-11-10 00:50:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:50:51,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:51,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:51,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:50:51,960 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:51,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1958100993, now seen corresponding path program 1 times [2024-11-10 00:50:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:51,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934446199] [2024-11-10 00:50:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:52,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:52,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934446199] [2024-11-10 00:50:52,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934446199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:52,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928420290] [2024-11-10 00:50:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:52,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:52,062 INFO L87 Difference]: Start difference. First operand 8735 states and 13695 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:52,162 INFO L93 Difference]: Finished difference Result 15933 states and 23579 transitions. [2024-11-10 00:50:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:52,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:50:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:52,175 INFO L225 Difference]: With dead ends: 15933 [2024-11-10 00:50:52,175 INFO L226 Difference]: Without dead ends: 8738 [2024-11-10 00:50:52,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:52,184 INFO L432 NwaCegarLoop]: 2238 mSDtfsCounter, 36 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4436 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:52,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4436 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8738 states. [2024-11-10 00:50:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8738 to 8735. [2024-11-10 00:50:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8735 states, 8733 states have (on average 1.5539906103286385) internal successors, (13571), 8734 states have internal predecessors, (13571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 13571 transitions. [2024-11-10 00:50:52,323 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 13571 transitions. Word has length 71 [2024-11-10 00:50:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:52,323 INFO L471 AbstractCegarLoop]: Abstraction has 8735 states and 13571 transitions. [2024-11-10 00:50:52,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 13571 transitions. [2024-11-10 00:50:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:50:52,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:52,325 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:52,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:50:52,325 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:52,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2054791999, now seen corresponding path program 1 times [2024-11-10 00:50:52,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:52,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354899669] [2024-11-10 00:50:52,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:52,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:52,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354899669] [2024-11-10 00:50:52,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354899669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:52,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:52,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:52,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231096803] [2024-11-10 00:50:52,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:52,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:52,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:52,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:52,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:52,387 INFO L87 Difference]: Start difference. First operand 8735 states and 13571 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:52,440 INFO L93 Difference]: Finished difference Result 11488 states and 17335 transitions. [2024-11-10 00:50:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:52,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:50:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:52,447 INFO L225 Difference]: With dead ends: 11488 [2024-11-10 00:50:52,447 INFO L226 Difference]: Without dead ends: 4293 [2024-11-10 00:50:52,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:52,453 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 32 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:52,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4433 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2024-11-10 00:50:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 4283. [2024-11-10 00:50:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4283 states, 4281 states have (on average 1.7572996963326326) internal successors, (7523), 4282 states have internal predecessors, (7523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 7523 transitions. [2024-11-10 00:50:52,509 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 7523 transitions. Word has length 71 [2024-11-10 00:50:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:52,509 INFO L471 AbstractCegarLoop]: Abstraction has 4283 states and 7523 transitions. [2024-11-10 00:50:52,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 7523 transitions. [2024-11-10 00:50:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:50:52,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:52,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:52,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:50:52,511 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:52,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:52,511 INFO L85 PathProgramCache]: Analyzing trace with hash 798912897, now seen corresponding path program 1 times [2024-11-10 00:50:52,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:52,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509410212] [2024-11-10 00:50:52,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:52,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:52,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:52,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509410212] [2024-11-10 00:50:52,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509410212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:52,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:52,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:52,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484025363] [2024-11-10 00:50:52,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:52,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:52,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:52,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:52,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:52,582 INFO L87 Difference]: Start difference. First operand 4283 states and 7523 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:52,618 INFO L93 Difference]: Finished difference Result 5653 states and 9375 transitions. [2024-11-10 00:50:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:52,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 00:50:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:52,623 INFO L225 Difference]: With dead ends: 5653 [2024-11-10 00:50:52,623 INFO L226 Difference]: Without dead ends: 2922 [2024-11-10 00:50:52,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:52,626 INFO L432 NwaCegarLoop]: 2230 mSDtfsCounter, 30 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4412 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:52,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4412 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2024-11-10 00:50:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2919. [2024-11-10 00:50:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2917 states have (on average 1.9379499485773055) internal successors, (5653), 2918 states have internal predecessors, (5653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 5653 transitions. [2024-11-10 00:50:52,663 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 5653 transitions. Word has length 73 [2024-11-10 00:50:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:52,663 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 5653 transitions. [2024-11-10 00:50:52,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 5653 transitions. [2024-11-10 00:50:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:50:52,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:52,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:52,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:50:52,664 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:52,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1102118600, now seen corresponding path program 1 times [2024-11-10 00:50:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205028424] [2024-11-10 00:50:52,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:52,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205028424] [2024-11-10 00:50:52,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205028424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:52,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:52,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:52,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268700121] [2024-11-10 00:50:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:52,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:52,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:52,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:52,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:52,727 INFO L87 Difference]: Start difference. First operand 2919 states and 5653 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:52,780 INFO L93 Difference]: Finished difference Result 3607 states and 6570 transitions. [2024-11-10 00:50:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:52,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-10 00:50:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:52,784 INFO L225 Difference]: With dead ends: 3607 [2024-11-10 00:50:52,784 INFO L226 Difference]: Without dead ends: 2240 [2024-11-10 00:50:52,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:52,786 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 27 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4397 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:52,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4397 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-11-10 00:50:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2237. [2024-11-10 00:50:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2235 states have (on average 2.115883668903803) internal successors, (4729), 2236 states have internal predecessors, (4729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 4729 transitions. [2024-11-10 00:50:52,812 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 4729 transitions. Word has length 75 [2024-11-10 00:50:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:52,812 INFO L471 AbstractCegarLoop]: Abstraction has 2237 states and 4729 transitions. [2024-11-10 00:50:52,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 4729 transitions. [2024-11-10 00:50:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:50:52,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:52,814 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:52,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:50:52,814 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:52,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1394283217, now seen corresponding path program 1 times [2024-11-10 00:50:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:52,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185395269] [2024-11-10 00:50:52,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185395269] [2024-11-10 00:50:53,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185395269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796663692] [2024-11-10 00:50:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:53,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:53,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:53,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:50:53,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:50:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:53,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:50:53,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:50:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:53,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:50:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:54,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796663692] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:50:54,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:50:54,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 00:50:54,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325376838] [2024-11-10 00:50:54,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:50:54,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 00:50:54,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:54,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 00:50:54,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:50:54,455 INFO L87 Difference]: Start difference. First operand 2237 states and 4729 transitions. Second operand has 25 states, 25 states have (on average 8.52) internal successors, (213), 24 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:55,509 INFO L93 Difference]: Finished difference Result 5206 states and 8659 transitions. [2024-11-10 00:50:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 00:50:55,509 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.52) internal successors, (213), 24 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 00:50:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:55,516 INFO L225 Difference]: With dead ends: 5206 [2024-11-10 00:50:55,516 INFO L226 Difference]: Without dead ends: 4521 [2024-11-10 00:50:55,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=526, Invalid=2230, Unknown=0, NotChecked=0, Total=2756 [2024-11-10 00:50:55,519 INFO L432 NwaCegarLoop]: 2185 mSDtfsCounter, 22637 mSDsluCounter, 9352 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22637 SdHoareTripleChecker+Valid, 11537 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:55,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22637 Valid, 11537 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:50:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4521 states. [2024-11-10 00:50:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4521 to 4459. [2024-11-10 00:50:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4459 states, 4457 states have (on average 1.6977787749607358) internal successors, (7567), 4458 states have internal predecessors, (7567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 7567 transitions. [2024-11-10 00:50:55,580 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 7567 transitions. Word has length 77 [2024-11-10 00:50:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:55,581 INFO L471 AbstractCegarLoop]: Abstraction has 4459 states and 7567 transitions. [2024-11-10 00:50:55,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.52) internal successors, (213), 24 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 7567 transitions. [2024-11-10 00:50:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:50:55,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:55,582 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:55,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 00:50:55,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:55,788 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:55,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1476797615, now seen corresponding path program 1 times [2024-11-10 00:50:55,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:55,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747336141] [2024-11-10 00:50:55,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747336141] [2024-11-10 00:50:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747336141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945496741] [2024-11-10 00:50:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:56,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:56,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:56,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:50:56,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:50:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:56,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:50:56,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:50:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:56,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:50:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:57,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945496741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:50:57,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:50:57,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 00:50:57,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576640117] [2024-11-10 00:50:57,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:50:57,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 00:50:57,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:57,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 00:50:57,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:50:57,295 INFO L87 Difference]: Start difference. First operand 4459 states and 7567 transitions. Second operand has 25 states, 25 states have (on average 7.56) internal successors, (189), 24 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:58,413 INFO L93 Difference]: Finished difference Result 16624 states and 23333 transitions. [2024-11-10 00:50:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 00:50:58,414 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.56) internal successors, (189), 24 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 00:50:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:58,432 INFO L225 Difference]: With dead ends: 16624 [2024-11-10 00:50:58,433 INFO L226 Difference]: Without dead ends: 13717 [2024-11-10 00:50:58,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=518, Invalid=2032, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 00:50:58,440 INFO L432 NwaCegarLoop]: 2202 mSDtfsCounter, 28737 mSDsluCounter, 9437 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28737 SdHoareTripleChecker+Valid, 11639 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:58,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28737 Valid, 11639 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:50:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13717 states. [2024-11-10 00:50:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13717 to 13523. [2024-11-10 00:50:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13523 states, 13521 states have (on average 1.4024850232970933) internal successors, (18963), 13522 states have internal predecessors, (18963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13523 states to 13523 states and 18963 transitions. [2024-11-10 00:50:58,702 INFO L78 Accepts]: Start accepts. Automaton has 13523 states and 18963 transitions. Word has length 77 [2024-11-10 00:50:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:58,702 INFO L471 AbstractCegarLoop]: Abstraction has 13523 states and 18963 transitions. [2024-11-10 00:50:58,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.56) internal successors, (189), 24 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 13523 states and 18963 transitions. [2024-11-10 00:50:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:50:58,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:58,705 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:58,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:50:58,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-10 00:50:58,909 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:58,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash -114225462, now seen corresponding path program 1 times [2024-11-10 00:50:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173988700] [2024-11-10 00:50:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:59,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:59,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173988700] [2024-11-10 00:50:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173988700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:59,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607503739] [2024-11-10 00:50:59,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:59,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:59,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:59,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:50:59,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:50:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:59,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-10 00:50:59,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:51:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:02,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:51:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:07,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607503739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:51:07,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:51:07,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 24] total 58 [2024-11-10 00:51:07,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343504456] [2024-11-10 00:51:07,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:51:07,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-10 00:51:07,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:07,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-10 00:51:07,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=2797, Unknown=0, NotChecked=0, Total=3306 [2024-11-10 00:51:07,281 INFO L87 Difference]: Start difference. First operand 13523 states and 18963 transitions. Second operand has 58 states, 58 states have (on average 3.5344827586206895) internal successors, (205), 58 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:51:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:20,884 INFO L93 Difference]: Finished difference Result 23557 states and 31732 transitions. [2024-11-10 00:51:20,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-11-10 00:51:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 3.5344827586206895) internal successors, (205), 58 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-10 00:51:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:20,903 INFO L225 Difference]: With dead ends: 23557 [2024-11-10 00:51:20,903 INFO L226 Difference]: Without dead ends: 18146 [2024-11-10 00:51:20,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5919 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=4636, Invalid=15104, Unknown=0, NotChecked=0, Total=19740 [2024-11-10 00:51:20,910 INFO L432 NwaCegarLoop]: 2238 mSDtfsCounter, 17842 mSDsluCounter, 29607 mSDsCounter, 0 mSdLazyCounter, 2679 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17842 SdHoareTripleChecker+Valid, 31845 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:20,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17842 Valid, 31845 Invalid, 2771 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [92 Valid, 2679 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 00:51:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18146 states. [2024-11-10 00:51:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18146 to 14214. [2024-11-10 00:51:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14214 states, 14212 states have (on average 1.3931888544891642) internal successors, (19800), 14213 states have internal predecessors, (19800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:51:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 19800 transitions. [2024-11-10 00:51:21,225 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 19800 transitions. Word has length 79 [2024-11-10 00:51:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:21,225 INFO L471 AbstractCegarLoop]: Abstraction has 14214 states and 19800 transitions. [2024-11-10 00:51:21,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 3.5344827586206895) internal successors, (205), 58 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:51:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 19800 transitions. [2024-11-10 00:51:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:51:21,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:21,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:51:21,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 00:51:21,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:21,428 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:21,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash -364228054, now seen corresponding path program 1 times [2024-11-10 00:51:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:21,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812334409] [2024-11-10 00:51:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812334409] [2024-11-10 00:51:22,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812334409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:51:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568008129] [2024-11-10 00:51:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:22,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:22,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:51:22,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:51:22,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:51:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:22,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 00:51:22,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:51:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:25,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:51:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:27,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568008129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:51:27,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:51:27,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 22] total 55 [2024-11-10 00:51:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027610191] [2024-11-10 00:51:27,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:51:27,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-10 00:51:27,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:27,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-10 00:51:27,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2619, Unknown=0, NotChecked=0, Total=2970 [2024-11-10 00:51:27,943 INFO L87 Difference]: Start difference. First operand 14214 states and 19800 transitions. Second operand has 55 states, 55 states have (on average 3.8727272727272726) internal successors, (213), 55 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)