./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6bd5a1b43baf28037f1364b515dd3aa33d97d8b4eac9039e625792f2e3fbcc41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:50:35,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:50:36,035 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:36,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:50:36,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:50:36,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:50:36,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:50:36,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:50:36,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:50:36,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:50:36,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:50:36,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:50:36,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:50:36,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:50:36,074 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:50:36,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:50:36,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:50:36,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:50:36,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:50:36,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:50:36,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:50:36,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:50:36,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:50:36,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:50:36,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:50:36,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:50:36,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:50:36,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:50:36,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:50:36,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:50:36,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:50:36,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:50:36,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:50:36,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:50:36,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:50:36,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:50:36,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:50:36,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:50:36,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:50:36,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:50:36,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:50:36,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:50:36,082 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 -> 6bd5a1b43baf28037f1364b515dd3aa33d97d8b4eac9039e625792f2e3fbcc41 [2024-11-10 00:50:36,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:50:36,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:50:36,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:50:36,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:50:36,335 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:50:36,336 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_label04.c [2024-11-10 00:50:37,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:50:37,988 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:50:37,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c [2024-11-10 00:50:38,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c49b9756/095a9f88f92e4a998bdd0062226f2eee/FLAG37f5cf752 [2024-11-10 00:50:38,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c49b9756/095a9f88f92e4a998bdd0062226f2eee [2024-11-10 00:50:38,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:50:38,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:50:38,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:50:38,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:50:38,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:50:38,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:50:38" (1/1) ... [2024-11-10 00:50:38,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac40eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:38, skipping insertion in model container [2024-11-10 00:50:38,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:50:38" (1/1) ... [2024-11-10 00:50:38,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:50:38,392 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_label04.c[8616,8629] [2024-11-10 00:50:38,444 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_label04.c[15677,15690] [2024-11-10 00:50:38,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:50:38,925 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:50:38,951 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_label04.c[8616,8629] [2024-11-10 00:50:38,962 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_label04.c[15677,15690] [2024-11-10 00:50:39,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:50:39,336 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:50:39,337 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,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:50:39,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:50:39,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:50:39,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:50:39,343 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,384 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,661 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5037 [2024-11-10 00:50:39,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:50:39,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:50:39,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:50:39,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:50:39,676 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,677 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,718 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,850 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,851 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,851 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,977 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,995 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:40,013 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:40,031 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:40,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:50:40,083 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:50:40,083 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:50:40,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:50:40,084 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:40,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:50:40,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:40,109 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:40,111 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:40,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:50:40,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:50:40,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:50:40,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:50:40,228 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:50:40,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:50:44,496 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5020: havoc calculate_output3_#t~ret36#1; [2024-11-10 00:50:44,496 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2051: havoc calculate_output_#t~ret34#1; [2024-11-10 00:50:44,496 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3530: havoc calculate_output2_#t~ret35#1; [2024-11-10 00:50:44,753 INFO L? ?]: Removed 2074 outVars from TransFormulas that were not future-live. [2024-11-10 00:50:44,753 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:50:44,793 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:50:44,795 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:50:44,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:50:44 BoogieIcfgContainer [2024-11-10 00:50:44,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:50:44,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:50:44,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:50:44,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:50:44,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:50:38" (1/3) ... [2024-11-10 00:50:44,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1713ec46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:50:44, skipping insertion in model container [2024-11-10 00:50:44,802 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:44,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1713ec46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:50:44, skipping insertion in model container [2024-11-10 00:50:44,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:50:44" (3/3) ... [2024-11-10 00:50:44,805 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c [2024-11-10 00:50:44,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:50:44,819 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:50:44,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:50:44,895 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;@262f72e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:50:44,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:50:44,906 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:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:50:44,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:44,914 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:44,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:44,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash -576025244, now seen corresponding path program 1 times [2024-11-10 00:50:44,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:44,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300889886] [2024-11-10 00:50:44,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:44,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:45,123 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:45,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:45,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300889886] [2024-11-10 00:50:45,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300889886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:45,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:45,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:50:45,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870798347] [2024-11-10 00:50:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:45,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:50:45,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:45,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:50:45,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:50:45,152 INFO L87 Difference]: Start difference. First operand has 892 states, 889 states have (on average 2.6636670416197976) internal successors, (2368), 891 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:45,224 INFO L93 Difference]: Finished difference Result 1753 states and 4680 transitions. [2024-11-10 00:50:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:50:45,227 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 00:50:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:45,246 INFO L225 Difference]: With dead ends: 1753 [2024-11-10 00:50:45,246 INFO L226 Difference]: Without dead ends: 824 [2024-11-10 00:50:45,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:50:45,257 INFO L432 NwaCegarLoop]: 2300 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:45,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-11-10 00:50:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-11-10 00:50:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 822 states have (on average 2.71654501216545) internal successors, (2233), 823 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2233 transitions. [2024-11-10 00:50:45,325 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2233 transitions. Word has length 24 [2024-11-10 00:50:45,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:45,326 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 2233 transitions. [2024-11-10 00:50:45,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2233 transitions. [2024-11-10 00:50:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:50:45,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:45,327 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:45,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:50:45,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:45,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:45,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1573097597, now seen corresponding path program 1 times [2024-11-10 00:50:45,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:45,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778582005] [2024-11-10 00:50:45,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:45,484 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:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778582005] [2024-11-10 00:50:45,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778582005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:45,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:45,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:50:45,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187311870] [2024-11-10 00:50:45,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:45,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:50:45,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:45,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:50:45,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:50:45,488 INFO L87 Difference]: Start difference. First operand 824 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:45,610 INFO L93 Difference]: Finished difference Result 906 states and 2357 transitions. [2024-11-10 00:50:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:50:45,610 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:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:45,614 INFO L225 Difference]: With dead ends: 906 [2024-11-10 00:50:45,614 INFO L226 Difference]: Without dead ends: 863 [2024-11-10 00:50:45,615 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:45,616 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 59 mSDsluCounter, 6658 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:45,616 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.1s Time] [2024-11-10 00:50:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-10 00:50:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 824. [2024-11-10 00:50:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 822 states have (on average 2.6885644768856447) internal successors, (2210), 823 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2210 transitions. [2024-11-10 00:50:45,639 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2210 transitions. Word has length 24 [2024-11-10 00:50:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:45,640 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 2210 transitions. [2024-11-10 00:50:45,640 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:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2210 transitions. [2024-11-10 00:50:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 00:50:45,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:45,642 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:45,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:50:45,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:45,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash 67352845, now seen corresponding path program 1 times [2024-11-10 00:50:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667156379] [2024-11-10 00:50:45,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:45,781 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:45,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:45,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667156379] [2024-11-10 00:50:45,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667156379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:45,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:45,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:45,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102411800] [2024-11-10 00:50:45,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:45,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:45,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:45,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:45,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:45,783 INFO L87 Difference]: Start difference. First operand 824 states and 2210 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:45,943 INFO L93 Difference]: Finished difference Result 1136 states and 2690 transitions. [2024-11-10 00:50:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:50:45,945 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:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:45,951 INFO L225 Difference]: With dead ends: 1136 [2024-11-10 00:50:45,951 INFO L226 Difference]: Without dead ends: 1097 [2024-11-10 00:50:45,952 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:45,953 INFO L432 NwaCegarLoop]: 2206 mSDtfsCounter, 8967 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8967 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:45,955 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:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-10 00:50:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 860. [2024-11-10 00:50:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 2.641025641025641) internal successors, (2266), 859 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2266 transitions. [2024-11-10 00:50:45,975 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2266 transitions. Word has length 46 [2024-11-10 00:50:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:45,975 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 2266 transitions. [2024-11-10 00:50:45,975 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:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2266 transitions. [2024-11-10 00:50:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 00:50:45,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:45,977 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:45,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:50:45,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:45,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1704032145, now seen corresponding path program 1 times [2024-11-10 00:50:45,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:45,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149939274] [2024-11-10 00:50:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:46,184 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:46,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:46,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149939274] [2024-11-10 00:50:46,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149939274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:46,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:46,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648892402] [2024-11-10 00:50:46,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:46,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:46,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:46,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:46,187 INFO L87 Difference]: Start difference. First operand 860 states and 2266 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:46,319 INFO L93 Difference]: Finished difference Result 938 states and 2384 transitions. [2024-11-10 00:50:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:50:46,320 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:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:46,323 INFO L225 Difference]: With dead ends: 938 [2024-11-10 00:50:46,323 INFO L226 Difference]: Without dead ends: 863 [2024-11-10 00:50:46,325 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:46,327 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:46,327 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:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-10 00:50:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 860. [2024-11-10 00:50:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 2.63986013986014) internal successors, (2265), 859 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2265 transitions. [2024-11-10 00:50:46,343 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2265 transitions. Word has length 48 [2024-11-10 00:50:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:46,344 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 2265 transitions. [2024-11-10 00:50:46,344 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:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2265 transitions. [2024-11-10 00:50:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 00:50:46,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:46,345 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:46,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:50:46,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:46,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash 438430262, now seen corresponding path program 1 times [2024-11-10 00:50:46,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:46,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314502589] [2024-11-10 00:50:46,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:46,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:46,390 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:46,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:46,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314502589] [2024-11-10 00:50:46,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314502589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:46,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:46,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:46,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805123487] [2024-11-10 00:50:46,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:46,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:46,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:46,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:46,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:46,392 INFO L87 Difference]: Start difference. First operand 860 states and 2265 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:46,421 INFO L93 Difference]: Finished difference Result 998 states and 2475 transitions. [2024-11-10 00:50:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:46,422 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:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:46,426 INFO L225 Difference]: With dead ends: 998 [2024-11-10 00:50:46,427 INFO L226 Difference]: Without dead ends: 923 [2024-11-10 00:50:46,428 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:46,428 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:46,430 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:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-10 00:50:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2024-11-10 00:50:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 918 states have (on average 2.565359477124183) internal successors, (2355), 919 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2355 transitions. [2024-11-10 00:50:46,449 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2355 transitions. Word has length 49 [2024-11-10 00:50:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:46,450 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 2355 transitions. [2024-11-10 00:50:46,450 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:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2355 transitions. [2024-11-10 00:50:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:50:46,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:46,453 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:46,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:50:46,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:46,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1147349681, now seen corresponding path program 1 times [2024-11-10 00:50:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:46,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721662140] [2024-11-10 00:50:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:46,508 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:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721662140] [2024-11-10 00:50:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721662140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:46,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:46,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:46,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031786682] [2024-11-10 00:50:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:46,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:46,510 INFO L87 Difference]: Start difference. First operand 920 states and 2355 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:46,533 INFO L93 Difference]: Finished difference Result 1065 states and 2575 transitions. [2024-11-10 00:50:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:46,534 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:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:46,538 INFO L225 Difference]: With dead ends: 1065 [2024-11-10 00:50:46,538 INFO L226 Difference]: Without dead ends: 990 [2024-11-10 00:50:46,539 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:46,542 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:46,543 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:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-10 00:50:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 987. [2024-11-10 00:50:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 985 states have (on average 2.4923857868020303) internal successors, (2455), 986 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2455 transitions. [2024-11-10 00:50:46,566 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2455 transitions. Word has length 50 [2024-11-10 00:50:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:46,566 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 2455 transitions. [2024-11-10 00:50:46,567 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:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2455 transitions. [2024-11-10 00:50:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:50:46,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:46,569 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:46,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:50:46,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:46,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:46,570 INFO L85 PathProgramCache]: Analyzing trace with hash 145939953, now seen corresponding path program 1 times [2024-11-10 00:50:46,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:46,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575858758] [2024-11-10 00:50:46,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:46,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:46,612 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:46,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:46,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575858758] [2024-11-10 00:50:46,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575858758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:46,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:46,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508128774] [2024-11-10 00:50:46,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:46,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:46,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:46,615 INFO L87 Difference]: Start difference. First operand 987 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:46,644 INFO L93 Difference]: Finished difference Result 1361 states and 3017 transitions. [2024-11-10 00:50:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:46,644 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:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:46,651 INFO L225 Difference]: With dead ends: 1361 [2024-11-10 00:50:46,651 INFO L226 Difference]: Without dead ends: 1162 [2024-11-10 00:50:46,652 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:46,652 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:46,653 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:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-11-10 00:50:46,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1159. [2024-11-10 00:50:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1157 states have (on average 2.3396715643906654) internal successors, (2707), 1158 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2707 transitions. [2024-11-10 00:50:46,677 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2707 transitions. Word has length 50 [2024-11-10 00:50:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:46,678 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 2707 transitions. [2024-11-10 00:50:46,678 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:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2707 transitions. [2024-11-10 00:50:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:50:46,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:46,679 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:46,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:50:46,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:46,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash 131490097, now seen corresponding path program 1 times [2024-11-10 00:50:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:46,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738184538] [2024-11-10 00:50:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:46,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:46,739 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:46,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:46,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738184538] [2024-11-10 00:50:46,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738184538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:46,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:46,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:46,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107053776] [2024-11-10 00:50:46,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:46,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:46,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:46,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:46,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:46,741 INFO L87 Difference]: Start difference. First operand 1159 states and 2707 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:46,773 INFO L93 Difference]: Finished difference Result 1853 states and 3731 transitions. [2024-11-10 00:50:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:46,774 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:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:46,780 INFO L225 Difference]: With dead ends: 1853 [2024-11-10 00:50:46,780 INFO L226 Difference]: Without dead ends: 1482 [2024-11-10 00:50:46,781 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:46,782 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:46,782 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:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2024-11-10 00:50:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1479. [2024-11-10 00:50:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1477 states have (on average 2.1415030467163167) internal successors, (3163), 1478 states have internal predecessors, (3163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3163 transitions. [2024-11-10 00:50:46,810 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3163 transitions. Word has length 50 [2024-11-10 00:50:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:46,810 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 3163 transitions. [2024-11-10 00:50:46,810 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:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3163 transitions. [2024-11-10 00:50:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:50:46,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:46,811 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:46,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:50:46,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:46,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2071874447, now seen corresponding path program 1 times [2024-11-10 00:50:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301523342] [2024-11-10 00:50:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:46,859 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:46,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301523342] [2024-11-10 00:50:46,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301523342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:46,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:46,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:46,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167935055] [2024-11-10 00:50:46,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:46,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:46,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:46,861 INFO L87 Difference]: Start difference. First operand 1479 states and 3163 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:46,909 INFO L93 Difference]: Finished difference Result 2765 states and 5015 transitions. [2024-11-10 00:50:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:46,910 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:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:46,916 INFO L225 Difference]: With dead ends: 2765 [2024-11-10 00:50:46,917 INFO L226 Difference]: Without dead ends: 2074 [2024-11-10 00:50:46,918 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:46,919 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:46,919 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:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2024-11-10 00:50:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2071. [2024-11-10 00:50:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2069 states have (on average 1.9231512808119864) internal successors, (3979), 2070 states have internal predecessors, (3979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3979 transitions. [2024-11-10 00:50:46,960 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3979 transitions. Word has length 50 [2024-11-10 00:50:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:46,960 INFO L471 AbstractCegarLoop]: Abstraction has 2071 states and 3979 transitions. [2024-11-10 00:50:46,961 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:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3979 transitions. [2024-11-10 00:50:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:50:46,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:46,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, 1, 1, 1, 1, 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:46,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:50:46,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1698815794, now seen corresponding path program 1 times [2024-11-10 00:50:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:46,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296615323] [2024-11-10 00:50:46,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:47,132 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:47,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:47,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296615323] [2024-11-10 00:50:47,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296615323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:47,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:47,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:50:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620813425] [2024-11-10 00:50:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:47,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:50:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:50:47,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:50:47,135 INFO L87 Difference]: Start difference. First operand 2071 states and 3979 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:47,192 INFO L93 Difference]: Finished difference Result 2170 states and 4109 transitions. [2024-11-10 00:50:47,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:50:47,193 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:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:47,200 INFO L225 Difference]: With dead ends: 2170 [2024-11-10 00:50:47,200 INFO L226 Difference]: Without dead ends: 2167 [2024-11-10 00:50:47,201 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:47,201 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:47,202 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:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2024-11-10 00:50:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2167. [2024-11-10 00:50:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2165 states have (on average 1.8785219399538107) internal successors, (4067), 2166 states have internal predecessors, (4067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 4067 transitions. [2024-11-10 00:50:47,246 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 4067 transitions. Word has length 50 [2024-11-10 00:50:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:47,247 INFO L471 AbstractCegarLoop]: Abstraction has 2167 states and 4067 transitions. [2024-11-10 00:50:47,247 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:47,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 4067 transitions. [2024-11-10 00:50:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 00:50:47,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:47,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:47,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:50:47,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:47,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:47,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1893743981, now seen corresponding path program 1 times [2024-11-10 00:50:47,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:47,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649838081] [2024-11-10 00:50:47,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:47,435 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:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649838081] [2024-11-10 00:50:47,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649838081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:47,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:47,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661301294] [2024-11-10 00:50:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:47,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:50:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:50:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:50:47,437 INFO L87 Difference]: Start difference. First operand 2167 states and 4067 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:53,692 INFO L93 Difference]: Finished difference Result 4426 states and 10420 transitions. [2024-11-10 00:50:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:50:53,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-10 00:50:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:53,703 INFO L225 Difference]: With dead ends: 4426 [2024-11-10 00:50:53,703 INFO L226 Difference]: Without dead ends: 3671 [2024-11-10 00:50:53,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:50:53,706 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 4417 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4417 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:53,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4417 Valid, 807 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-10 00:50:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2024-11-10 00:50:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3671. [2024-11-10 00:50:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3669 states have (on average 2.018261106568547) internal successors, (7405), 3670 states have internal predecessors, (7405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 7405 transitions. [2024-11-10 00:50:53,769 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 7405 transitions. Word has length 63 [2024-11-10 00:50:53,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:53,769 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 7405 transitions. [2024-11-10 00:50:53,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 7405 transitions. [2024-11-10 00:50:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:50:53,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:53,770 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:53,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:50:53,770 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:53,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:53,771 INFO L85 PathProgramCache]: Analyzing trace with hash -26766179, now seen corresponding path program 1 times [2024-11-10 00:50:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:53,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560483197] [2024-11-10 00:50:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:53,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:53,880 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:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:53,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560483197] [2024-11-10 00:50:53,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560483197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:53,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:53,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566498599] [2024-11-10 00:50:53,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:53,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:53,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:53,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:53,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:53,883 INFO L87 Difference]: Start difference. First operand 3671 states and 7405 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:54,039 INFO L93 Difference]: Finished difference Result 9118 states and 14951 transitions. [2024-11-10 00:50:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:50:54,040 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:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:54,070 INFO L225 Difference]: With dead ends: 9118 [2024-11-10 00:50:54,070 INFO L226 Difference]: Without dead ends: 8123 [2024-11-10 00:50:54,074 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:54,075 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:54,075 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:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8123 states. [2024-11-10 00:50:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8123 to 4863. [2024-11-10 00:50:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 4861 states have (on average 1.859082493314133) internal successors, (9037), 4862 states have internal predecessors, (9037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 9037 transitions. [2024-11-10 00:50:54,193 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 9037 transitions. Word has length 69 [2024-11-10 00:50:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:54,193 INFO L471 AbstractCegarLoop]: Abstraction has 4863 states and 9037 transitions. [2024-11-10 00:50:54,193 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:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 9037 transitions. [2024-11-10 00:50:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:50:54,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:54,197 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:54,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:50:54,197 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:54,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1028175907, now seen corresponding path program 1 times [2024-11-10 00:50:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395055402] [2024-11-10 00:50:54,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:54,332 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:54,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395055402] [2024-11-10 00:50:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395055402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:54,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:54,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918983980] [2024-11-10 00:50:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:54,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:54,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:54,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:54,335 INFO L87 Difference]: Start difference. First operand 4863 states and 9037 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:54,492 INFO L93 Difference]: Finished difference Result 10494 states and 16847 transitions. [2024-11-10 00:50:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:50:54,493 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:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:54,507 INFO L225 Difference]: With dead ends: 10494 [2024-11-10 00:50:54,507 INFO L226 Difference]: Without dead ends: 9115 [2024-11-10 00:50:54,512 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:54,513 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 6709 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6709 SdHoareTripleChecker+Valid, 4740 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:54,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6709 Valid, 4740 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:50:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9115 states. [2024-11-10 00:50:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9115 to 6735. [2024-11-10 00:50:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6735 states, 6733 states have (on average 1.7224120005940888) internal successors, (11597), 6734 states have internal predecessors, (11597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6735 states to 6735 states and 11597 transitions. [2024-11-10 00:50:54,665 INFO L78 Accepts]: Start accepts. Automaton has 6735 states and 11597 transitions. Word has length 69 [2024-11-10 00:50:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:54,665 INFO L471 AbstractCegarLoop]: Abstraction has 6735 states and 11597 transitions. [2024-11-10 00:50:54,665 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:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 6735 states and 11597 transitions. [2024-11-10 00:50:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:50:54,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:54,667 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:54,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:50:54,667 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:54,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1042625763, now seen corresponding path program 1 times [2024-11-10 00:50:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:54,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003611660] [2024-11-10 00:50:54,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:54,775 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:54,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:54,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003611660] [2024-11-10 00:50:54,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003611660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:54,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:54,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:54,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920565901] [2024-11-10 00:50:54,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:54,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:54,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:54,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:54,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:54,777 INFO L87 Difference]: Start difference. First operand 6735 states and 11597 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:54,968 INFO L93 Difference]: Finished difference Result 11870 states and 18735 transitions. [2024-11-10 00:50:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:50:54,968 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:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:54,984 INFO L225 Difference]: With dead ends: 11870 [2024-11-10 00:50:54,984 INFO L226 Difference]: Without dead ends: 10491 [2024-11-10 00:50:54,989 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:54,989 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 6731 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6731 SdHoareTripleChecker+Valid, 4738 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:54,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6731 Valid, 4738 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:50:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10491 states. [2024-11-10 00:50:55,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10491 to 8111. [2024-11-10 00:50:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8111 states, 8109 states have (on average 1.6629670736219015) internal successors, (13485), 8110 states have internal predecessors, (13485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8111 states to 8111 states and 13485 transitions. [2024-11-10 00:50:55,148 INFO L78 Accepts]: Start accepts. Automaton has 8111 states and 13485 transitions. Word has length 69 [2024-11-10 00:50:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:55,148 INFO L471 AbstractCegarLoop]: Abstraction has 8111 states and 13485 transitions. [2024-11-10 00:50:55,148 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:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8111 states and 13485 transitions. [2024-11-10 00:50:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:50:55,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:55,150 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:55,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:50:55,150 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:55,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1048976989, now seen corresponding path program 1 times [2024-11-10 00:50:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:55,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634593481] [2024-11-10 00:50:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:55,240 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:55,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634593481] [2024-11-10 00:50:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634593481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:55,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:55,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:50:55,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281050667] [2024-11-10 00:50:55,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:55,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:50:55,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:50:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:50:55,242 INFO L87 Difference]: Start difference. First operand 8111 states and 13485 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:55,494 INFO L93 Difference]: Finished difference Result 13246 states and 20623 transitions. [2024-11-10 00:50:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:50:55,495 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:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:55,513 INFO L225 Difference]: With dead ends: 13246 [2024-11-10 00:50:55,513 INFO L226 Difference]: Without dead ends: 11867 [2024-11-10 00:50:55,518 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:55,518 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 6721 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:55,519 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:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2024-11-10 00:50:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 9487. [2024-11-10 00:50:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9487 states, 9485 states have (on average 1.6207696362677912) internal successors, (15373), 9486 states have internal predecessors, (15373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9487 states to 9487 states and 15373 transitions. [2024-11-10 00:50:55,688 INFO L78 Accepts]: Start accepts. Automaton has 9487 states and 15373 transitions. Word has length 69 [2024-11-10 00:50:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:55,688 INFO L471 AbstractCegarLoop]: Abstraction has 9487 states and 15373 transitions. [2024-11-10 00:50:55,689 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:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 9487 states and 15373 transitions. [2024-11-10 00:50:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:50:55,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:55,691 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:55,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:50:55,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1958100993, now seen corresponding path program 1 times [2024-11-10 00:50:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:55,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304940496] [2024-11-10 00:50:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:55,765 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:55,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:55,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304940496] [2024-11-10 00:50:55,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304940496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:55,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:55,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464050177] [2024-11-10 00:50:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:55,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:55,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:55,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:55,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:55,769 INFO L87 Difference]: Start difference. First operand 9487 states and 15373 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:55,875 INFO L93 Difference]: Finished difference Result 16685 states and 25257 transitions. [2024-11-10 00:50:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:55,875 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:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:55,890 INFO L225 Difference]: With dead ends: 16685 [2024-11-10 00:50:55,890 INFO L226 Difference]: Without dead ends: 9490 [2024-11-10 00:50:55,898 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:55,899 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:55,899 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:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9490 states. [2024-11-10 00:50:56,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9490 to 9487. [2024-11-10 00:50:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9487 states, 9485 states have (on average 1.6076963626779124) internal successors, (15249), 9486 states have internal predecessors, (15249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9487 states to 9487 states and 15249 transitions. [2024-11-10 00:50:56,054 INFO L78 Accepts]: Start accepts. Automaton has 9487 states and 15249 transitions. Word has length 71 [2024-11-10 00:50:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:56,054 INFO L471 AbstractCegarLoop]: Abstraction has 9487 states and 15249 transitions. [2024-11-10 00:50:56,054 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:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 9487 states and 15249 transitions. [2024-11-10 00:50:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:50:56,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:56,055 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:56,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:50:56,056 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:56,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:56,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2054791999, now seen corresponding path program 1 times [2024-11-10 00:50:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:56,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829750908] [2024-11-10 00:50:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:56,122 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:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829750908] [2024-11-10 00:50:56,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829750908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:56,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:56,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:56,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128751437] [2024-11-10 00:50:56,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:56,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:56,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:56,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:56,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:56,124 INFO L87 Difference]: Start difference. First operand 9487 states and 15249 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:56,266 INFO L93 Difference]: Finished difference Result 12240 states and 19013 transitions. [2024-11-10 00:50:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:56,266 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:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:56,275 INFO L225 Difference]: With dead ends: 12240 [2024-11-10 00:50:56,275 INFO L226 Difference]: Without dead ends: 5045 [2024-11-10 00:50:56,280 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:56,281 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:56,281 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:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2024-11-10 00:50:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 5035. [2024-11-10 00:50:56,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5035 states, 5033 states have (on average 1.8281343135306973) internal successors, (9201), 5034 states have internal predecessors, (9201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 9201 transitions. [2024-11-10 00:50:56,390 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 9201 transitions. Word has length 71 [2024-11-10 00:50:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:56,390 INFO L471 AbstractCegarLoop]: Abstraction has 5035 states and 9201 transitions. [2024-11-10 00:50:56,391 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:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 9201 transitions. [2024-11-10 00:50:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:50:56,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:56,392 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:56,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:50:56,392 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:56,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash 798912897, now seen corresponding path program 1 times [2024-11-10 00:50:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664674151] [2024-11-10 00:50:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:56,483 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:56,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:56,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664674151] [2024-11-10 00:50:56,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664674151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:56,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:56,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:56,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61658720] [2024-11-10 00:50:56,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:56,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:56,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:56,486 INFO L87 Difference]: Start difference. First operand 5035 states and 9201 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:56,543 INFO L93 Difference]: Finished difference Result 6405 states and 11053 transitions. [2024-11-10 00:50:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:56,543 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:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:56,550 INFO L225 Difference]: With dead ends: 6405 [2024-11-10 00:50:56,550 INFO L226 Difference]: Without dead ends: 3674 [2024-11-10 00:50:56,554 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:56,554 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:56,555 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:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2024-11-10 00:50:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3671. [2024-11-10 00:50:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3669 states have (on average 1.998092123194331) internal successors, (7331), 3670 states have internal predecessors, (7331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 7331 transitions. [2024-11-10 00:50:56,630 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 7331 transitions. Word has length 73 [2024-11-10 00:50:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:56,630 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 7331 transitions. [2024-11-10 00:50:56,630 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:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 7331 transitions. [2024-11-10 00:50:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:50:56,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:56,632 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:56,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:50:56,632 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:56,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:56,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1102118600, now seen corresponding path program 1 times [2024-11-10 00:50:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:56,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578091489] [2024-11-10 00:50:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:56,716 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:56,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:56,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578091489] [2024-11-10 00:50:56,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578091489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:56,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:56,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:56,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396280444] [2024-11-10 00:50:56,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:56,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:50:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:50:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:56,719 INFO L87 Difference]: Start difference. First operand 3671 states and 7331 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:56,763 INFO L93 Difference]: Finished difference Result 4359 states and 8248 transitions. [2024-11-10 00:50:56,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:56,764 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:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:56,769 INFO L225 Difference]: With dead ends: 4359 [2024-11-10 00:50:56,770 INFO L226 Difference]: Without dead ends: 2992 [2024-11-10 00:50:56,772 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:56,772 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:56,773 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:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2024-11-10 00:50:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2989. [2024-11-10 00:50:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2987 states have (on average 2.144961499832608) internal successors, (6407), 2988 states have internal predecessors, (6407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 6407 transitions. [2024-11-10 00:50:56,829 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 6407 transitions. Word has length 75 [2024-11-10 00:50:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:56,830 INFO L471 AbstractCegarLoop]: Abstraction has 2989 states and 6407 transitions. [2024-11-10 00:50:56,830 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:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 6407 transitions. [2024-11-10 00:50:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:50:56,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:56,832 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:56,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:50:56,832 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:56,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1394283217, now seen corresponding path program 1 times [2024-11-10 00:50:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:56,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142594227] [2024-11-10 00:50:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:56,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:57,178 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:57,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:57,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142594227] [2024-11-10 00:50:57,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142594227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:57,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385407759] [2024-11-10 00:50:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:57,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:57,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:57,183 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:57,184 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:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:57,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:50:57,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:50:57,737 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:57,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:50:58,447 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:58,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385407759] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:50:58,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:50:58,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-10 00:50:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371435588] [2024-11-10 00:50:58,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:50:58,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 00:50:58,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:58,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 00:50:58,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:50:58,450 INFO L87 Difference]: Start difference. First operand 2989 states and 6407 transitions. Second operand has 22 states, 22 states have (on average 8.227272727272727) internal successors, (181), 21 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call 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,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:58,952 INFO L93 Difference]: Finished difference Result 4428 states and 8316 transitions. [2024-11-10 00:50:58,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:50:58,958 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.227272727272727) internal successors, (181), 21 states have internal predecessors, (181), 0 states have call successors, (0), 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,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:58,964 INFO L225 Difference]: With dead ends: 4428 [2024-11-10 00:50:58,964 INFO L226 Difference]: Without dead ends: 3743 [2024-11-10 00:50:58,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 00:50:58,966 INFO L432 NwaCegarLoop]: 2185 mSDtfsCounter, 15611 mSDsluCounter, 6848 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15611 SdHoareTripleChecker+Valid, 9033 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:58,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15611 Valid, 9033 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:50:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2024-11-10 00:50:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3715. [2024-11-10 00:50:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3715 states, 3713 states have (on average 1.9773767842714787) internal successors, (7342), 3714 states have internal predecessors, (7342), 0 states have call successors, (0), 0 states have call 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:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3715 states to 3715 states and 7342 transitions. [2024-11-10 00:50:59,019 INFO L78 Accepts]: Start accepts. Automaton has 3715 states and 7342 transitions. Word has length 77 [2024-11-10 00:50:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:59,019 INFO L471 AbstractCegarLoop]: Abstraction has 3715 states and 7342 transitions. [2024-11-10 00:50:59,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.227272727272727) internal successors, (181), 21 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call 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:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3715 states and 7342 transitions. [2024-11-10 00:50:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:50:59,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:59,020 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:59,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:50:59,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:59,225 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:59,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1347842287, now seen corresponding path program 1 times [2024-11-10 00:50:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:59,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954163059] [2024-11-10 00:50:59,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:59,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:59,876 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:59,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:59,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954163059] [2024-11-10 00:50:59,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954163059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:59,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220160790] [2024-11-10 00:50:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:59,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:59,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:59,879 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:59,880 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:51:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:00,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 00:51:00,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:51:01,261 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:51:01,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:51:03,564 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:51:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220160790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:51:03,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:51:03,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 41 [2024-11-10 00:51:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663344694] [2024-11-10 00:51:03,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:51:03,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:51:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:03,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:51:03,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1498, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:51:03,566 INFO L87 Difference]: Start difference. First operand 3715 states and 7342 transitions. Second operand has 42 states, 42 states have (on average 4.690476190476191) internal successors, (197), 41 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call 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:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:13,808 INFO L93 Difference]: Finished difference Result 20653 states and 29079 transitions. [2024-11-10 00:51:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-11-10 00:51:13,809 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.690476190476191) internal successors, (197), 41 states have internal predecessors, (197), 0 states have call successors, (0), 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:51:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:13,831 INFO L225 Difference]: With dead ends: 20653 [2024-11-10 00:51:13,831 INFO L226 Difference]: Without dead ends: 19242 [2024-11-10 00:51:13,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7603 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3198, Invalid=18558, Unknown=0, NotChecked=0, Total=21756 [2024-11-10 00:51:13,840 INFO L432 NwaCegarLoop]: 2197 mSDtfsCounter, 39540 mSDsluCounter, 25172 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39540 SdHoareTripleChecker+Valid, 27369 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:13,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39540 Valid, 27369 Invalid, 2050 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 1950 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 00:51:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19242 states. [2024-11-10 00:51:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19242 to 9627. [2024-11-10 00:51:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9627 states, 9625 states have (on average 1.5507532467532468) internal successors, (14926), 9626 states have internal predecessors, (14926), 0 states have call successors, (0), 0 states have call 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:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9627 states to 9627 states and 14926 transitions. [2024-11-10 00:51:14,078 INFO L78 Accepts]: Start accepts. Automaton has 9627 states and 14926 transitions. Word has length 77 [2024-11-10 00:51:14,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:14,079 INFO L471 AbstractCegarLoop]: Abstraction has 9627 states and 14926 transitions. [2024-11-10 00:51:14,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.690476190476191) internal successors, (197), 41 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call 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:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 9627 states and 14926 transitions. [2024-11-10 00:51:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:51:14,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:14,081 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] [2024-11-10 00:51:14,094 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:51:14,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-10 00:51:14,286 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:14,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:14,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1782885555, now seen corresponding path program 1 times [2024-11-10 00:51:14,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:14,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431364677] [2024-11-10 00:51:14,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:14,569 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:14,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:14,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431364677] [2024-11-10 00:51:14,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431364677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:51:14,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136620897] [2024-11-10 00:51:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:14,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:14,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:51:14,572 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:51:14,573 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:51:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:14,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:51:14,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:51:15,007 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:15,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:51:15,455 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:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136620897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:51:15,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:51:15,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-10 00:51:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583452495] [2024-11-10 00:51:15,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:51:15,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 00:51:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:15,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 00:51:15,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:51:15,457 INFO L87 Difference]: Start difference. First operand 9627 states and 14926 transitions. Second operand has 22 states, 22 states have (on average 7.818181818181818) internal successors, (172), 21 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call 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:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:15,999 INFO L93 Difference]: Finished difference Result 21840 states and 30678 transitions. [2024-11-10 00:51:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:51:15,999 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.818181818181818) internal successors, (172), 21 states have internal predecessors, (172), 0 states have call successors, (0), 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 78 [2024-11-10 00:51:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:16,016 INFO L225 Difference]: With dead ends: 21840 [2024-11-10 00:51:16,017 INFO L226 Difference]: Without dead ends: 14517 [2024-11-10 00:51:16,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 00:51:16,026 INFO L432 NwaCegarLoop]: 2201 mSDtfsCounter, 19860 mSDsluCounter, 6849 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19860 SdHoareTripleChecker+Valid, 9050 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:16,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19860 Valid, 9050 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:51:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14517 states. [2024-11-10 00:51:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14517 to 14203. [2024-11-10 00:51:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14203 states, 14201 states have (on average 1.456165058798676) internal successors, (20679), 14202 states have internal predecessors, (20679), 0 states have call successors, (0), 0 states have call 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:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14203 states to 14203 states and 20679 transitions. [2024-11-10 00:51:16,344 INFO L78 Accepts]: Start accepts. Automaton has 14203 states and 20679 transitions. Word has length 78 [2024-11-10 00:51:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:16,344 INFO L471 AbstractCegarLoop]: Abstraction has 14203 states and 20679 transitions. [2024-11-10 00:51:16,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.818181818181818) internal successors, (172), 21 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call 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:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 14203 states and 20679 transitions. [2024-11-10 00:51:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:51:16,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:16,347 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:16,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:51:16,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:16,551 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:16,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash -114225462, now seen corresponding path program 1 times [2024-11-10 00:51:16,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:16,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790813135] [2024-11-10 00:51:16,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:16,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:17,262 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:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790813135] [2024-11-10 00:51:17,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790813135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:51:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735771264] [2024-11-10 00:51:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:17,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:17,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:51:17,266 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:17,267 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:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:17,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-10 00:51:17,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:51:20,233 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:20,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:51:24,479 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:24,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735771264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:51:24,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:51:24,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 24, 23] total 55 [2024-11-10 00:51:24,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066915609] [2024-11-10 00:51:24,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:51:24,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-10 00:51:24,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:24,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-10 00:51:24,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=2494, Unknown=0, NotChecked=0, Total=2970 [2024-11-10 00:51:24,481 INFO L87 Difference]: Start difference. First operand 14203 states and 20679 transitions. Second operand has 55 states, 55 states have (on average 3.690909090909091) internal successors, (203), 55 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call 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:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:37,122 INFO L93 Difference]: Finished difference Result 29421 states and 40006 transitions. [2024-11-10 00:51:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-10 00:51:37,123 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.690909090909091) internal successors, (203), 55 states have internal predecessors, (203), 0 states have call successors, (0), 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:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:37,145 INFO L225 Difference]: With dead ends: 29421 [2024-11-10 00:51:37,145 INFO L226 Difference]: Without dead ends: 24034 [2024-11-10 00:51:37,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5679 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3875, Invalid=13681, Unknown=0, NotChecked=0, Total=17556 [2024-11-10 00:51:37,156 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 29633 mSDsluCounter, 35713 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29633 SdHoareTripleChecker+Valid, 37940 SdHoareTripleChecker+Invalid, 2490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:37,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29633 Valid, 37940 Invalid, 2490 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [91 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 00:51:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24034 states. [2024-11-10 00:51:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24034 to 17596. [2024-11-10 00:51:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17596 states, 17594 states have (on average 1.4191201545981584) internal successors, (24968), 17595 states have internal predecessors, (24968), 0 states have call successors, (0), 0 states have call 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:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17596 states to 17596 states and 24968 transitions. [2024-11-10 00:51:37,618 INFO L78 Accepts]: Start accepts. Automaton has 17596 states and 24968 transitions. Word has length 79 [2024-11-10 00:51:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:37,618 INFO L471 AbstractCegarLoop]: Abstraction has 17596 states and 24968 transitions. [2024-11-10 00:51:37,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.690909090909091) internal successors, (203), 55 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call 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:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 17596 states and 24968 transitions. [2024-11-10 00:51:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:51:37,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:37,620 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:37,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:51:37,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:37,823 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:37,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:37,823 INFO L85 PathProgramCache]: Analyzing trace with hash -364228054, now seen corresponding path program 1 times [2024-11-10 00:51:37,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:37,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029350481] [2024-11-10 00:51:37,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:37,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:38,440 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:38,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:38,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029350481] [2024-11-10 00:51:38,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029350481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:51:38,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752865196] [2024-11-10 00:51:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:38,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:38,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:51:38,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:51:38,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:51:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:38,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 00:51:38,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:51:39,057 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:39,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:51:39,496 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:39,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752865196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:51:39,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:51:39,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28 [2024-11-10 00:51:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385270145] [2024-11-10 00:51:39,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:51:39,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 00:51:39,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:39,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 00:51:39,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:51:39,497 INFO L87 Difference]: Start difference. First operand 17596 states and 24968 transitions. Second operand has 28 states, 28 states have (on average 6.321428571428571) internal successors, (177), 28 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call 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:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:40,474 INFO L93 Difference]: Finished difference Result 22644 states and 31531 transitions. [2024-11-10 00:51:40,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 00:51:40,475 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.321428571428571) internal successors, (177), 28 states have internal predecessors, (177), 0 states have call successors, (0), 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:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:40,495 INFO L225 Difference]: With dead ends: 22644 [2024-11-10 00:51:40,495 INFO L226 Difference]: Without dead ends: 16553 [2024-11-10 00:51:40,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1301, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 00:51:40,505 INFO L432 NwaCegarLoop]: 2182 mSDtfsCounter, 15907 mSDsluCounter, 19804 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15907 SdHoareTripleChecker+Valid, 21986 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:40,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15907 Valid, 21986 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:51:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16553 states. [2024-11-10 00:51:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16553 to 16547. [2024-11-10 00:51:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16547 states, 16545 states have (on average 1.4272589906316107) internal successors, (23614), 16546 states have internal predecessors, (23614), 0 states have call successors, (0), 0 states have call 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:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16547 states to 16547 states and 23614 transitions. [2024-11-10 00:51:41,025 INFO L78 Accepts]: Start accepts. Automaton has 16547 states and 23614 transitions. Word has length 79 [2024-11-10 00:51:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:41,025 INFO L471 AbstractCegarLoop]: Abstraction has 16547 states and 23614 transitions. [2024-11-10 00:51:41,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.321428571428571) internal successors, (177), 28 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call 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:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 16547 states and 23614 transitions. [2024-11-10 00:51:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:51:41,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:41,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:51:41,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 00:51:41,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 00:51:41,231 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:41,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash 236259826, now seen corresponding path program 1 times [2024-11-10 00:51:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:41,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793655930] [2024-11-10 00:51:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:41,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:41,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793655930] [2024-11-10 00:51:41,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793655930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:51:41,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671347301] [2024-11-10 00:51:41,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:41,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:41,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:51:41,826 INFO L229 MonitoredProcess]: Starting monitored process 7 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:41,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 00:51:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:41,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 00:51:41,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:51:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:42,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:51:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:43,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671347301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:51:43,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:51:43,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2024-11-10 00:51:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513895809] [2024-11-10 00:51:43,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:51:43,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 00:51:43,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 00:51:43,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:51:43,060 INFO L87 Difference]: Start difference. First operand 16547 states and 23614 transitions. Second operand has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call 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:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:44,641 INFO L93 Difference]: Finished difference Result 36207 states and 48792 transitions. [2024-11-10 00:51:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 00:51:44,642 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:51:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:44,673 INFO L225 Difference]: With dead ends: 36207 [2024-11-10 00:51:44,674 INFO L226 Difference]: Without dead ends: 24924 [2024-11-10 00:51:44,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=481, Invalid=1969, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 00:51:44,689 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 20571 mSDsluCounter, 11373 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20571 SdHoareTripleChecker+Valid, 13580 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:44,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20571 Valid, 13580 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:51:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24924 states. [2024-11-10 00:51:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24924 to 15403. [2024-11-10 00:51:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15403 states, 15401 states have (on average 1.4325693136809299) internal successors, (22063), 15402 states have internal predecessors, (22063), 0 states have call successors, (0), 0 states have call 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:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15403 states to 15403 states and 22063 transitions. [2024-11-10 00:51:45,175 INFO L78 Accepts]: Start accepts. Automaton has 15403 states and 22063 transitions. Word has length 80 [2024-11-10 00:51:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:45,175 INFO L471 AbstractCegarLoop]: Abstraction has 15403 states and 22063 transitions. [2024-11-10 00:51:45,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.0) internal successors, (192), 32 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call 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:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 15403 states and 22063 transitions. [2024-11-10 00:51:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:51:45,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:45,177 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:51:45,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 00:51:45,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:45,377 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:45,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash 144408366, now seen corresponding path program 1 times [2024-11-10 00:51:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976612997] [2024-11-10 00:51:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:51:45,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:45,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976612997] [2024-11-10 00:51:45,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976612997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:51:45,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295001412] [2024-11-10 00:51:45,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:45,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:45,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:51:45,488 INFO L229 MonitoredProcess]: Starting monitored process 8 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:45,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 00:51:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:45,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 00:51:45,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:51:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:51:45,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:51:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:51:45,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295001412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:51:45,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:51:45,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-11-10 00:51:45,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402800286] [2024-11-10 00:51:45,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:51:45,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:51:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:45,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:51:45,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:51:45,844 INFO L87 Difference]: Start difference. First operand 15403 states and 22063 transitions. Second operand has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call 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:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:51:46,678 INFO L93 Difference]: Finished difference Result 35943 states and 47392 transitions. [2024-11-10 00:51:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:51:46,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 0 states have call successors, (0), 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 81 [2024-11-10 00:51:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:51:46,707 INFO L225 Difference]: With dead ends: 35943 [2024-11-10 00:51:46,707 INFO L226 Difference]: Without dead ends: 22844 [2024-11-10 00:51:46,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:51:46,720 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 4359 mSDsluCounter, 4581 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 6786 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:51:46,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4359 Valid, 6786 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:51:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22844 states. [2024-11-10 00:51:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22844 to 21584. [2024-11-10 00:51:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21584 states, 21582 states have (on average 1.3385228431099991) internal successors, (28888), 21583 states have internal predecessors, (28888), 0 states have call successors, (0), 0 states have call 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:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21584 states to 21584 states and 28888 transitions. [2024-11-10 00:51:47,459 INFO L78 Accepts]: Start accepts. Automaton has 21584 states and 28888 transitions. Word has length 81 [2024-11-10 00:51:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:51:47,459 INFO L471 AbstractCegarLoop]: Abstraction has 21584 states and 28888 transitions. [2024-11-10 00:51:47,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call 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:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 21584 states and 28888 transitions. [2024-11-10 00:51:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:51:47,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:51:47,461 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:51:47,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 00:51:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:47,665 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:51:47,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:51:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1511861325, now seen corresponding path program 1 times [2024-11-10 00:51:47,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:51:47,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071295184] [2024-11-10 00:51:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:51:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:48,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:51:48,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071295184] [2024-11-10 00:51:48,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071295184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:51:48,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225817548] [2024-11-10 00:51:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:51:48,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:51:48,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:51:48,180 INFO L229 MonitoredProcess]: Starting monitored process 9 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:48,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 00:51:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:51:48,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 00:51:48,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:51:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:50,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:51:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:51:53,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225817548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:51:53,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:51:53,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 23] total 53 [2024-11-10 00:51:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625174889] [2024-11-10 00:51:53,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:51:53,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-10 00:51:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:51:53,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-10 00:51:53,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2430, Unknown=0, NotChecked=0, Total=2756 [2024-11-10 00:51:53,513 INFO L87 Difference]: Start difference. First operand 21584 states and 28888 transitions. Second operand has 53 states, 53 states have (on average 4.056603773584905) internal successors, (215), 53 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)