./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.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.UNBOUNDED.pals+Problem12_label07.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 4fdd5c1041cb450f4848a5d2243efab154355b9039f1e674dfe24010b27b76eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:52:07,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:52:07,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:52:07,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:52:07,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:52:07,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:52:07,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:52:07,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:52:07,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:52:07,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:52:07,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:52:07,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:52:07,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:52:07,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:52:07,976 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:52:07,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:52:07,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:52:07,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:52:07,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:52:07,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:52:07,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:52:07,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:52:07,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:52:07,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:52:07,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:52:07,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:52:07,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:52:07,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:52:07,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:52:07,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:52:07,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:52:07,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:52:07,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:52:07,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:52:07,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:52:07,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:52:07,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:52:07,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:52:07,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:52:07,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:52:07,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:52:07,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:52:07,988 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 -> 4fdd5c1041cb450f4848a5d2243efab154355b9039f1e674dfe24010b27b76eb [2024-11-10 00:52:08,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:52:08,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:52:08,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:52:08,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:52:08,252 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:52:08,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-11-10 00:52:09,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:52:10,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:52:10,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-11-10 00:52:10,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccc1e4f6/df60d8275ae141c6ab1bd6c589e978ee/FLAG053380e7f [2024-11-10 00:52:10,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccc1e4f6/df60d8275ae141c6ab1bd6c589e978ee [2024-11-10 00:52:10,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:52:10,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:52:10,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:52:10,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:52:10,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:52:10,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:52:10" (1/1) ... [2024-11-10 00:52:10,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41164a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:10, skipping insertion in model container [2024-11-10 00:52:10,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:52:10" (1/1) ... [2024-11-10 00:52:10,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:52:10,446 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.UNBOUNDED.pals+Problem12_label07.c[8712,8725] [2024-11-10 00:52:10,468 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.UNBOUNDED.pals+Problem12_label07.c[9554,9567] [2024-11-10 00:52:11,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:52:11,072 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:52:11,102 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.UNBOUNDED.pals+Problem12_label07.c[8712,8725] [2024-11-10 00:52:11,106 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.UNBOUNDED.pals+Problem12_label07.c[9554,9567] [2024-11-10 00:52:11,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:52:11,428 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:52:11,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11 WrapperNode [2024-11-10 00:52:11,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:52:11,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:52:11,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:52:11,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:52:11,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:11,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:11,672 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5037 [2024-11-10 00:52:11,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:52:11,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:52:11,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:52:11,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:52:11,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:11,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:11,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:12,041 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:52:12,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:12,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:12,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:12,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:12,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:12,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:12,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:52:12,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:52:12,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:52:12,316 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:52:12,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (1/1) ... [2024-11-10 00:52:12,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:52:12,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:12,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:52:12,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:52:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:52:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:52:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:52:12,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:52:12,486 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:52:12,488 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:52:17,146 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2024-11-10 00:52:17,146 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2024-11-10 00:52:17,146 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2024-11-10 00:52:17,460 INFO L? ?]: Removed 2076 outVars from TransFormulas that were not future-live. [2024-11-10 00:52:17,460 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:52:17,493 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:52:17,493 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:52:17,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:52:17 BoogieIcfgContainer [2024-11-10 00:52:17,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:52:17,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:52:17,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:52:17,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:52:17,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:52:10" (1/3) ... [2024-11-10 00:52:17,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ec2404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:52:17, skipping insertion in model container [2024-11-10 00:52:17,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:11" (2/3) ... [2024-11-10 00:52:17,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ec2404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:52:17, skipping insertion in model container [2024-11-10 00:52:17,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:52:17" (3/3) ... [2024-11-10 00:52:17,500 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-11-10 00:52:17,514 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:52:17,514 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:52:17,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:52:17,586 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;@498c4d45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:52:17,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:52:17,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 894 states, 891 states have (on average 2.6610549943883277) internal successors, (2371), 893 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 00:52:17,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:17,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:17,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:17,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash 23030433, now seen corresponding path program 1 times [2024-11-10 00:52:17,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:17,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402354513] [2024-11-10 00:52:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:17,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:17,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402354513] [2024-11-10 00:52:17,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402354513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:17,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:17,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:52:17,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677282160] [2024-11-10 00:52:17,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:17,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:17,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:17,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:17,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:17,922 INFO L87 Difference]: Start difference. First operand has 894 states, 891 states have (on average 2.6610549943883277) internal successors, (2371), 893 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:22,380 INFO L93 Difference]: Finished difference Result 2511 states and 6867 transitions. [2024-11-10 00:52:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:22,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-10 00:52:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:22,412 INFO L225 Difference]: With dead ends: 2511 [2024-11-10 00:52:22,413 INFO L226 Difference]: Without dead ends: 1578 [2024-11-10 00:52:22,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:22,425 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1686 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 4568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:22,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 277 Invalid, 4568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-10 00:52:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-10 00:52:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2024-11-10 00:52:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1576 states have (on average 2.700507614213198) internal successors, (4256), 1577 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 4256 transitions. [2024-11-10 00:52:22,546 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 4256 transitions. Word has length 9 [2024-11-10 00:52:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:22,547 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 4256 transitions. [2024-11-10 00:52:22,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 4256 transitions. [2024-11-10 00:52:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:52:22,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:22,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:22,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:52:22,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:22,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:22,551 INFO L85 PathProgramCache]: Analyzing trace with hash 63786145, now seen corresponding path program 1 times [2024-11-10 00:52:22,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:22,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092826403] [2024-11-10 00:52:22,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:22,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:22,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092826403] [2024-11-10 00:52:22,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092826403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:22,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:22,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:52:22,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953503289] [2024-11-10 00:52:22,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:22,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:52:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:22,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:52:22,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:22,774 INFO L87 Difference]: Start difference. First operand 1578 states and 4256 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:22,852 INFO L93 Difference]: Finished difference Result 1623 states and 4323 transitions. [2024-11-10 00:52:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:52:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 00:52:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:22,860 INFO L225 Difference]: With dead ends: 1623 [2024-11-10 00:52:22,860 INFO L226 Difference]: Without dead ends: 1578 [2024-11-10 00:52:22,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:22,863 INFO L432 NwaCegarLoop]: 2234 mSDtfsCounter, 0 mSDsluCounter, 6674 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8908 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:22,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8908 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-10 00:52:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2024-11-10 00:52:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1576 states have (on average 2.6859137055837565) internal successors, (4233), 1577 states have internal predecessors, (4233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 4233 transitions. [2024-11-10 00:52:22,909 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 4233 transitions. Word has length 24 [2024-11-10 00:52:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:22,910 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 4233 transitions. [2024-11-10 00:52:22,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 4233 transitions. [2024-11-10 00:52:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 00:52:22,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:22,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:22,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:52:22,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:22,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:22,914 INFO L85 PathProgramCache]: Analyzing trace with hash -38432181, now seen corresponding path program 1 times [2024-11-10 00:52:22,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:22,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94209204] [2024-11-10 00:52:22,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:23,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:23,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94209204] [2024-11-10 00:52:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94209204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:23,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:23,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:23,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908377677] [2024-11-10 00:52:23,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:23,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:23,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:23,080 INFO L87 Difference]: Start difference. First operand 1578 states and 4233 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:23,289 INFO L93 Difference]: Finished difference Result 1906 states and 4737 transitions. [2024-11-10 00:52:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:52:23,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-10 00:52:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:23,300 INFO L225 Difference]: With dead ends: 1906 [2024-11-10 00:52:23,300 INFO L226 Difference]: Without dead ends: 1865 [2024-11-10 00:52:23,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:52:23,305 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 9037 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9037 SdHoareTripleChecker+Valid, 2853 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:23,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9037 Valid, 2853 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2024-11-10 00:52:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1616. [2024-11-10 00:52:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1614 states have (on average 2.6592317224287485) internal successors, (4292), 1615 states have internal predecessors, (4292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 4292 transitions. [2024-11-10 00:52:23,344 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 4292 transitions. Word has length 46 [2024-11-10 00:52:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:23,344 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 4292 transitions. [2024-11-10 00:52:23,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 4292 transitions. [2024-11-10 00:52:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 00:52:23,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:23,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:23,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:52:23,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:23,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash -284227027, now seen corresponding path program 1 times [2024-11-10 00:52:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:23,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939847457] [2024-11-10 00:52:23,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:23,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939847457] [2024-11-10 00:52:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939847457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:23,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948523826] [2024-11-10 00:52:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:23,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:23,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:23,564 INFO L87 Difference]: Start difference. First operand 1616 states and 4292 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:23,679 INFO L93 Difference]: Finished difference Result 1698 states and 4416 transitions. [2024-11-10 00:52:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:23,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-10 00:52:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:23,687 INFO L225 Difference]: With dead ends: 1698 [2024-11-10 00:52:23,688 INFO L226 Difference]: Without dead ends: 1619 [2024-11-10 00:52:23,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:52:23,693 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 6507 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6507 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:23,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6507 Valid, 2384 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2024-11-10 00:52:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1616. [2024-11-10 00:52:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1614 states have (on average 2.658612143742255) internal successors, (4291), 1615 states have internal predecessors, (4291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 4291 transitions. [2024-11-10 00:52:23,733 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 4291 transitions. Word has length 48 [2024-11-10 00:52:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:23,734 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 4291 transitions. [2024-11-10 00:52:23,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 4291 transitions. [2024-11-10 00:52:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 00:52:23,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:23,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:23,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:52:23,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:23,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1502715960, now seen corresponding path program 1 times [2024-11-10 00:52:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372457142] [2024-11-10 00:52:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:23,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:23,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372457142] [2024-11-10 00:52:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372457142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:23,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:23,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:23,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334308475] [2024-11-10 00:52:23,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:23,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:23,810 INFO L87 Difference]: Start difference. First operand 1616 states and 4291 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:23,847 INFO L93 Difference]: Finished difference Result 1762 states and 4513 transitions. [2024-11-10 00:52:23,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:23,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-10 00:52:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:23,856 INFO L225 Difference]: With dead ends: 1762 [2024-11-10 00:52:23,856 INFO L226 Difference]: Without dead ends: 1683 [2024-11-10 00:52:23,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:23,860 INFO L432 NwaCegarLoop]: 2209 mSDtfsCounter, 2160 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:23,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2265 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-11-10 00:52:23,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1678. [2024-11-10 00:52:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1676 states have (on average 2.6151551312649164) internal successors, (4383), 1677 states have internal predecessors, (4383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 4383 transitions. [2024-11-10 00:52:23,893 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 4383 transitions. Word has length 49 [2024-11-10 00:52:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:23,893 INFO L471 AbstractCegarLoop]: Abstraction has 1678 states and 4383 transitions. [2024-11-10 00:52:23,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 4383 transitions. [2024-11-10 00:52:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:23,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:23,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:23,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:52:23,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:23,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1220941777, now seen corresponding path program 1 times [2024-11-10 00:52:23,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:23,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481152458] [2024-11-10 00:52:23,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:23,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:23,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481152458] [2024-11-10 00:52:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481152458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:23,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:23,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517984099] [2024-11-10 00:52:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:23,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:23,946 INFO L87 Difference]: Start difference. First operand 1678 states and 4383 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:23,978 INFO L93 Difference]: Finished difference Result 1944 states and 4781 transitions. [2024-11-10 00:52:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:23,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:23,987 INFO L225 Difference]: With dead ends: 1944 [2024-11-10 00:52:23,988 INFO L226 Difference]: Without dead ends: 1803 [2024-11-10 00:52:23,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:23,990 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 2171 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:23,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 2320 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2024-11-10 00:52:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1800. [2024-11-10 00:52:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1798 states have (on average 2.5372636262513906) internal successors, (4562), 1799 states have internal predecessors, (4562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 4562 transitions. [2024-11-10 00:52:24,029 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 4562 transitions. Word has length 50 [2024-11-10 00:52:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:24,030 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 4562 transitions. [2024-11-10 00:52:24,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 4562 transitions. [2024-11-10 00:52:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:24,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:24,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:52:24,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:24,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1235391633, now seen corresponding path program 1 times [2024-11-10 00:52:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84930013] [2024-11-10 00:52:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:24,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84930013] [2024-11-10 00:52:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84930013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:24,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456660042] [2024-11-10 00:52:24,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:24,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:24,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:24,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:24,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,108 INFO L87 Difference]: Start difference. First operand 1800 states and 4562 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:24,146 INFO L93 Difference]: Finished difference Result 2294 states and 5290 transitions. [2024-11-10 00:52:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:24,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:24,155 INFO L225 Difference]: With dead ends: 2294 [2024-11-10 00:52:24,155 INFO L226 Difference]: Without dead ends: 2031 [2024-11-10 00:52:24,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,157 INFO L432 NwaCegarLoop]: 2250 mSDtfsCounter, 2169 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:24,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 2322 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2024-11-10 00:52:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2028. [2024-11-10 00:52:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 2026 states have (on average 2.4126357354392893) internal successors, (4888), 2027 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 4888 transitions. [2024-11-10 00:52:24,194 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 4888 transitions. Word has length 50 [2024-11-10 00:52:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:24,195 INFO L471 AbstractCegarLoop]: Abstraction has 2028 states and 4888 transitions. [2024-11-10 00:52:24,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 4888 transitions. [2024-11-10 00:52:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:24,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:24,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:24,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:52:24,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:24,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash 856211119, now seen corresponding path program 1 times [2024-11-10 00:52:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:24,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741930910] [2024-11-10 00:52:24,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:24,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741930910] [2024-11-10 00:52:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741930910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:24,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900675851] [2024-11-10 00:52:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:24,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:24,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:24,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,237 INFO L87 Difference]: Start difference. First operand 2028 states and 4888 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:24,289 INFO L93 Difference]: Finished difference Result 2946 states and 6212 transitions. [2024-11-10 00:52:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:24,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:24,307 INFO L225 Difference]: With dead ends: 2946 [2024-11-10 00:52:24,311 INFO L226 Difference]: Without dead ends: 2455 [2024-11-10 00:52:24,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,316 INFO L432 NwaCegarLoop]: 2248 mSDtfsCounter, 2167 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2167 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:24,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2167 Valid, 2324 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2024-11-10 00:52:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2452. [2024-11-10 00:52:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2450 states have (on average 2.2351020408163267) internal successors, (5476), 2451 states have internal predecessors, (5476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 5476 transitions. [2024-11-10 00:52:24,427 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 5476 transitions. Word has length 50 [2024-11-10 00:52:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:24,428 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 5476 transitions. [2024-11-10 00:52:24,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 5476 transitions. [2024-11-10 00:52:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:24,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:24,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:24,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:52:24,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:24,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash 331934064, now seen corresponding path program 1 times [2024-11-10 00:52:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563817970] [2024-11-10 00:52:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:24,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563817970] [2024-11-10 00:52:24,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563817970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:24,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:24,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:52:24,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323040301] [2024-11-10 00:52:24,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:24,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:52:24,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:24,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:52:24,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:52:24,759 INFO L87 Difference]: Start difference. First operand 2452 states and 5476 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:24,982 INFO L93 Difference]: Finished difference Result 2503 states and 5542 transitions. [2024-11-10 00:52:24,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:52:24,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:24,991 INFO L225 Difference]: With dead ends: 2503 [2024-11-10 00:52:24,991 INFO L226 Difference]: Without dead ends: 2500 [2024-11-10 00:52:24,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:52:24,992 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 0 mSDsluCounter, 13229 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15436 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:24,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15436 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2024-11-10 00:52:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2500. [2024-11-10 00:52:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2498 states have (on average 2.2081665332265814) internal successors, (5516), 2499 states have internal predecessors, (5516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 5516 transitions. [2024-11-10 00:52:25,052 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 5516 transitions. Word has length 50 [2024-11-10 00:52:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:25,053 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 5516 transitions. [2024-11-10 00:52:25,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 5516 transitions. [2024-11-10 00:52:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 00:52:25,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:25,054 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] [2024-11-10 00:52:25,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:52:25,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:25,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:25,055 INFO L85 PathProgramCache]: Analyzing trace with hash 922171759, now seen corresponding path program 1 times [2024-11-10 00:52:25,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:25,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407136618] [2024-11-10 00:52:25,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:25,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:25,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:25,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407136618] [2024-11-10 00:52:25,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407136618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:25,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:25,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:25,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83183108] [2024-11-10 00:52:25,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:25,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:25,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:25,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:25,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:25,100 INFO L87 Difference]: Start difference. First operand 2500 states and 5516 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:25,152 INFO L93 Difference]: Finished difference Result 3534 states and 6981 transitions. [2024-11-10 00:52:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:25,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-10 00:52:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:25,163 INFO L225 Difference]: With dead ends: 3534 [2024-11-10 00:52:25,163 INFO L226 Difference]: Without dead ends: 2970 [2024-11-10 00:52:25,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:25,166 INFO L432 NwaCegarLoop]: 2257 mSDtfsCounter, 2170 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:25,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2024-11-10 00:52:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 2967. [2024-11-10 00:52:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 2965 states have (on average 2.0745362563237775) internal successors, (6151), 2966 states have internal predecessors, (6151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 6151 transitions. [2024-11-10 00:52:25,243 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 6151 transitions. Word has length 52 [2024-11-10 00:52:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:25,243 INFO L471 AbstractCegarLoop]: Abstraction has 2967 states and 6151 transitions. [2024-11-10 00:52:25,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 6151 transitions. [2024-11-10 00:52:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:25,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:25,245 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:25,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:52:25,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:25,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1969902973, now seen corresponding path program 1 times [2024-11-10 00:52:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:25,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130160355] [2024-11-10 00:52:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:52:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:25,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130160355] [2024-11-10 00:52:25,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130160355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:25,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:25,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:25,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534477989] [2024-11-10 00:52:25,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:25,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:25,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:25,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:25,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:25,370 INFO L87 Difference]: Start difference. First operand 2967 states and 6151 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:25,565 INFO L93 Difference]: Finished difference Result 8998 states and 14489 transitions. [2024-11-10 00:52:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:25,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:52:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:25,590 INFO L225 Difference]: With dead ends: 8998 [2024-11-10 00:52:25,590 INFO L226 Difference]: Without dead ends: 7571 [2024-11-10 00:52:25,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:25,596 INFO L432 NwaCegarLoop]: 2271 mSDtfsCounter, 6728 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6728 SdHoareTripleChecker+Valid, 4736 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:25,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6728 Valid, 4736 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2024-11-10 00:52:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 4391. [2024-11-10 00:52:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4391 states, 4389 states have (on average 1.8462064251537935) internal successors, (8103), 4390 states have internal predecessors, (8103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 4391 states and 8103 transitions. [2024-11-10 00:52:25,750 INFO L78 Accepts]: Start accepts. Automaton has 4391 states and 8103 transitions. Word has length 69 [2024-11-10 00:52:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:25,750 INFO L471 AbstractCegarLoop]: Abstraction has 4391 states and 8103 transitions. [2024-11-10 00:52:25,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4391 states and 8103 transitions. [2024-11-10 00:52:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:25,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:25,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:25,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:52:25,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1955453117, now seen corresponding path program 1 times [2024-11-10 00:52:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430498906] [2024-11-10 00:52:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:52:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:25,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430498906] [2024-11-10 00:52:25,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430498906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:25,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:25,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:25,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141461473] [2024-11-10 00:52:25,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:25,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:25,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:25,877 INFO L87 Difference]: Start difference. First operand 4391 states and 8103 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:26,105 INFO L93 Difference]: Finished difference Result 10422 states and 16441 transitions. [2024-11-10 00:52:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:26,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:52:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:26,123 INFO L225 Difference]: With dead ends: 10422 [2024-11-10 00:52:26,123 INFO L226 Difference]: Without dead ends: 8995 [2024-11-10 00:52:26,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:26,130 INFO L432 NwaCegarLoop]: 2267 mSDtfsCounter, 6750 mSDsluCounter, 2435 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6750 SdHoareTripleChecker+Valid, 4702 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:26,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6750 Valid, 4702 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8995 states. [2024-11-10 00:52:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8995 to 6535. [2024-11-10 00:52:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6535 states, 6533 states have (on average 1.6860554109903567) internal successors, (11015), 6534 states have internal predecessors, (11015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6535 states to 6535 states and 11015 transitions. [2024-11-10 00:52:26,330 INFO L78 Accepts]: Start accepts. Automaton has 6535 states and 11015 transitions. Word has length 69 [2024-11-10 00:52:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:26,331 INFO L471 AbstractCegarLoop]: Abstraction has 6535 states and 11015 transitions. [2024-11-10 00:52:26,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6535 states and 11015 transitions. [2024-11-10 00:52:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:26,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:26,335 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:26,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:52:26,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:26,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -247911427, now seen corresponding path program 1 times [2024-11-10 00:52:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129683716] [2024-11-10 00:52:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:52:26,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:26,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129683716] [2024-11-10 00:52:26,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129683716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:26,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:26,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:26,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038648484] [2024-11-10 00:52:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:26,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:26,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:26,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:26,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:26,456 INFO L87 Difference]: Start difference. First operand 6535 states and 11015 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:26,742 INFO L93 Difference]: Finished difference Result 11846 states and 18393 transitions. [2024-11-10 00:52:26,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:26,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:52:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:26,761 INFO L225 Difference]: With dead ends: 11846 [2024-11-10 00:52:26,761 INFO L226 Difference]: Without dead ends: 10419 [2024-11-10 00:52:26,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:26,767 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 6733 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6733 SdHoareTripleChecker+Valid, 4725 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:26,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6733 Valid, 4725 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:26,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10419 states. [2024-11-10 00:52:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10419 to 7959. [2024-11-10 00:52:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7959 states, 7957 states have (on average 1.6296342842779943) internal successors, (12967), 7958 states have internal predecessors, (12967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 12967 transitions. [2024-11-10 00:52:26,931 INFO L78 Accepts]: Start accepts. Automaton has 7959 states and 12967 transitions. Word has length 69 [2024-11-10 00:52:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:26,931 INFO L471 AbstractCegarLoop]: Abstraction has 7959 states and 12967 transitions. [2024-11-10 00:52:26,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 7959 states and 12967 transitions. [2024-11-10 00:52:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:52:26,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:26,933 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:26,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:52:26,934 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:26,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1285540063, now seen corresponding path program 1 times [2024-11-10 00:52:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:26,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402658637] [2024-11-10 00:52:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402658637] [2024-11-10 00:52:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402658637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:27,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:27,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993173105] [2024-11-10 00:52:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:27,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:27,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:27,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:27,049 INFO L87 Difference]: Start difference. First operand 7959 states and 12967 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:27,117 INFO L93 Difference]: Finished difference Result 12593 states and 19400 transitions. [2024-11-10 00:52:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:27,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:52:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:27,128 INFO L225 Difference]: With dead ends: 12593 [2024-11-10 00:52:27,128 INFO L226 Difference]: Without dead ends: 6174 [2024-11-10 00:52:27,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:27,136 INFO L432 NwaCegarLoop]: 2247 mSDtfsCounter, 43 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4445 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:27,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4445 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2024-11-10 00:52:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 6171. [2024-11-10 00:52:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6171 states, 6169 states have (on average 1.7070838061274112) internal successors, (10531), 6170 states have internal predecessors, (10531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6171 states to 6171 states and 10531 transitions. [2024-11-10 00:52:27,243 INFO L78 Accepts]: Start accepts. Automaton has 6171 states and 10531 transitions. Word has length 71 [2024-11-10 00:52:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:27,243 INFO L471 AbstractCegarLoop]: Abstraction has 6171 states and 10531 transitions. [2024-11-10 00:52:27,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 6171 states and 10531 transitions. [2024-11-10 00:52:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:52:27,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:27,244 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:27,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:52:27,245 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:27,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash 717327165, now seen corresponding path program 1 times [2024-11-10 00:52:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:27,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187120454] [2024-11-10 00:52:27,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:27,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:52:27,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:27,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187120454] [2024-11-10 00:52:27,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187120454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:27,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:27,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:27,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994961378] [2024-11-10 00:52:27,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:27,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:27,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:27,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:27,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:27,335 INFO L87 Difference]: Start difference. First operand 6171 states and 10531 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:27,492 INFO L93 Difference]: Finished difference Result 10282 states and 16237 transitions. [2024-11-10 00:52:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:27,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:52:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:27,508 INFO L225 Difference]: With dead ends: 10282 [2024-11-10 00:52:27,508 INFO L226 Difference]: Without dead ends: 9255 [2024-11-10 00:52:27,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:27,514 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 6731 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6731 SdHoareTripleChecker+Valid, 4797 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:27,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6731 Valid, 4797 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9255 states. [2024-11-10 00:52:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9255 to 7195. [2024-11-10 00:52:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7195 states, 7193 states have (on average 1.659808146809398) internal successors, (11939), 7194 states have internal predecessors, (11939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 11939 transitions. [2024-11-10 00:52:27,682 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 11939 transitions. Word has length 71 [2024-11-10 00:52:27,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:27,682 INFO L471 AbstractCegarLoop]: Abstraction has 7195 states and 11939 transitions. [2024-11-10 00:52:27,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 11939 transitions. [2024-11-10 00:52:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:52:27,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:27,684 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:27,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:52:27,685 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:27,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash 151031455, now seen corresponding path program 1 times [2024-11-10 00:52:27,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:27,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340609858] [2024-11-10 00:52:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:27,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:27,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340609858] [2024-11-10 00:52:27,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340609858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:27,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:27,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:27,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865129489] [2024-11-10 00:52:27,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:27,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:27,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:27,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:27,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:27,771 INFO L87 Difference]: Start difference. First operand 7195 states and 11939 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:27,828 INFO L93 Difference]: Finished difference Result 10017 states and 15815 transitions. [2024-11-10 00:52:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:27,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 00:52:27,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:27,836 INFO L225 Difference]: With dead ends: 10017 [2024-11-10 00:52:27,837 INFO L226 Difference]: Without dead ends: 4382 [2024-11-10 00:52:27,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:27,843 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 36 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4430 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:27,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4430 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2024-11-10 00:52:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 4379. [2024-11-10 00:52:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4379 states, 4377 states have (on average 1.8329906328535526) internal successors, (8023), 4378 states have internal predecessors, (8023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4379 states to 4379 states and 8023 transitions. [2024-11-10 00:52:27,920 INFO L78 Accepts]: Start accepts. Automaton has 4379 states and 8023 transitions. Word has length 73 [2024-11-10 00:52:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:27,920 INFO L471 AbstractCegarLoop]: Abstraction has 4379 states and 8023 transitions. [2024-11-10 00:52:27,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4379 states and 8023 transitions. [2024-11-10 00:52:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:52:27,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:27,922 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] [2024-11-10 00:52:27,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:52:27,922 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:27,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash 450631713, now seen corresponding path program 1 times [2024-11-10 00:52:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:27,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063094492] [2024-11-10 00:52:27,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:28,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:28,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063094492] [2024-11-10 00:52:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063094492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:28,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:28,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:28,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103312671] [2024-11-10 00:52:28,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:28,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:28,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:28,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:28,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:28,003 INFO L87 Difference]: Start difference. First operand 4379 states and 8023 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:28,039 INFO L93 Difference]: Finished difference Result 5793 states and 9941 transitions. [2024-11-10 00:52:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-10 00:52:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:28,045 INFO L225 Difference]: With dead ends: 5793 [2024-11-10 00:52:28,046 INFO L226 Difference]: Without dead ends: 2974 [2024-11-10 00:52:28,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:28,050 INFO L432 NwaCegarLoop]: 2233 mSDtfsCounter, 31 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:28,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 4415 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2024-11-10 00:52:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2971. [2024-11-10 00:52:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2969 states have (on average 2.0501852475581) internal successors, (6087), 2970 states have internal predecessors, (6087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 6087 transitions. [2024-11-10 00:52:28,179 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 6087 transitions. Word has length 75 [2024-11-10 00:52:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:28,179 INFO L471 AbstractCegarLoop]: Abstraction has 2971 states and 6087 transitions. [2024-11-10 00:52:28,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 6087 transitions. [2024-11-10 00:52:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:52:28,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:28,180 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, 1, 1] [2024-11-10 00:52:28,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:52:28,180 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:28,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1411349864, now seen corresponding path program 1 times [2024-11-10 00:52:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:28,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836406814] [2024-11-10 00:52:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:28,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:28,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836406814] [2024-11-10 00:52:28,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836406814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:28,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:28,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315637128] [2024-11-10 00:52:28,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:28,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:28,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:28,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:28,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:28,251 INFO L87 Difference]: Start difference. First operand 2971 states and 6087 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:28,278 INFO L93 Difference]: Finished difference Result 3681 states and 7037 transitions. [2024-11-10 00:52:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:28,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 00:52:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:28,283 INFO L225 Difference]: With dead ends: 3681 [2024-11-10 00:52:28,283 INFO L226 Difference]: Without dead ends: 2270 [2024-11-10 00:52:28,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:28,286 INFO L432 NwaCegarLoop]: 2226 mSDtfsCounter, 28 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4400 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:28,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4400 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2024-11-10 00:52:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2267. [2024-11-10 00:52:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2267 states, 2265 states have (on average 2.2649006622516556) internal successors, (5130), 2266 states have internal predecessors, (5130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 5130 transitions. [2024-11-10 00:52:28,320 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 5130 transitions. Word has length 77 [2024-11-10 00:52:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:28,320 INFO L471 AbstractCegarLoop]: Abstraction has 2267 states and 5130 transitions. [2024-11-10 00:52:28,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 5130 transitions. [2024-11-10 00:52:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:52:28,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:28,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:28,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:52:28,323 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash -575781937, now seen corresponding path program 1 times [2024-11-10 00:52:28,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:28,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111856215] [2024-11-10 00:52:28,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111856215] [2024-11-10 00:52:28,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111856215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410028557] [2024-11-10 00:52:28,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:28,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:28,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:28,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:28,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:52:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:28,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 00:52:28,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:30,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:33,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410028557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:33,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:33,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 22] total 46 [2024-11-10 00:52:33,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425954479] [2024-11-10 00:52:33,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:33,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-10 00:52:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:33,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-10 00:52:33,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1747, Unknown=0, NotChecked=0, Total=2070 [2024-11-10 00:52:33,144 INFO L87 Difference]: Start difference. First operand 2267 states and 5130 transitions. Second operand has 46 states, 46 states have (on average 4.586956521739131) internal successors, (211), 46 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:41,929 INFO L93 Difference]: Finished difference Result 8172 states and 12871 transitions. [2024-11-10 00:52:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-10 00:52:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.586956521739131) internal successors, (211), 46 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-10 00:52:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:41,943 INFO L225 Difference]: With dead ends: 8172 [2024-11-10 00:52:41,943 INFO L226 Difference]: Without dead ends: 7465 [2024-11-10 00:52:41,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4369 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2775, Invalid=11031, Unknown=0, NotChecked=0, Total=13806 [2024-11-10 00:52:41,950 INFO L432 NwaCegarLoop]: 2176 mSDtfsCounter, 26564 mSDsluCounter, 16153 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26564 SdHoareTripleChecker+Valid, 18329 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:41,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26564 Valid, 18329 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 00:52:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2024-11-10 00:52:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 4403. [2024-11-10 00:52:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4403 states, 4401 states have (on average 1.7943649170643037) internal successors, (7897), 4402 states have internal predecessors, (7897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4403 states to 4403 states and 7897 transitions. [2024-11-10 00:52:42,065 INFO L78 Accepts]: Start accepts. Automaton has 4403 states and 7897 transitions. Word has length 79 [2024-11-10 00:52:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:42,065 INFO L471 AbstractCegarLoop]: Abstraction has 4403 states and 7897 transitions. [2024-11-10 00:52:42,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.586956521739131) internal successors, (211), 46 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4403 states and 7897 transitions. [2024-11-10 00:52:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:52:42,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:42,067 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:42,082 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:52:42,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:42,269 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:42,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -87597339, now seen corresponding path program 1 times [2024-11-10 00:52:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114509499] [2024-11-10 00:52:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:42,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114509499] [2024-11-10 00:52:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114509499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:42,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:42,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229474370] [2024-11-10 00:52:42,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:42,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:52:42,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:42,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:52:42,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:52:42,412 INFO L87 Difference]: Start difference. First operand 4403 states and 7897 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:49,440 INFO L93 Difference]: Finished difference Result 8166 states and 18193 transitions. [2024-11-10 00:52:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:52:49,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-10 00:52:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:49,452 INFO L225 Difference]: With dead ends: 8166 [2024-11-10 00:52:49,452 INFO L226 Difference]: Without dead ends: 6659 [2024-11-10 00:52:49,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:49,456 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 4401 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4401 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 9022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:49,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4401 Valid, 810 Invalid, 9022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-10 00:52:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2024-11-10 00:52:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 6659. [2024-11-10 00:52:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6659 states, 6657 states have (on average 1.9631966351209253) internal successors, (13069), 6658 states have internal predecessors, (13069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6659 states to 6659 states and 13069 transitions. [2024-11-10 00:52:49,574 INFO L78 Accepts]: Start accepts. Automaton has 6659 states and 13069 transitions. Word has length 79 [2024-11-10 00:52:49,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:49,575 INFO L471 AbstractCegarLoop]: Abstraction has 6659 states and 13069 transitions. [2024-11-10 00:52:49,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand 6659 states and 13069 transitions. [2024-11-10 00:52:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:52:49,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:49,576 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, 1] [2024-11-10 00:52:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:52:49,576 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:49,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1386621459, now seen corresponding path program 1 times [2024-11-10 00:52:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372150975] [2024-11-10 00:52:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:49,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:49,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372150975] [2024-11-10 00:52:49,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372150975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:49,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141252550] [2024-11-10 00:52:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:49,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:49,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:49,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:49,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:52:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:50,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-10 00:52:50,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:55,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:53:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:53:03,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141252550] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:53:03,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:53:03,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 28, 31] total 65 [2024-11-10 00:53:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594369866] [2024-11-10 00:53:03,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:53:03,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-10 00:53:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:03,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-10 00:53:03,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=3520, Unknown=0, NotChecked=0, Total=4160 [2024-11-10 00:53:03,056 INFO L87 Difference]: Start difference. First operand 6659 states and 13069 transitions. Second operand has 65 states, 65 states have (on average 3.3230769230769233) internal successors, (216), 65 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:53:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:34,558 INFO L93 Difference]: Finished difference Result 31907 states and 45667 transitions. [2024-11-10 00:53:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-11-10 00:53:34,559 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.3230769230769233) internal successors, (216), 65 states have internal predecessors, (216), 0 states have call successors, (0), 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:53:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:34,625 INFO L225 Difference]: With dead ends: 31907 [2024-11-10 00:53:34,629 INFO L226 Difference]: Without dead ends: 29064 [2024-11-10 00:53:34,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12153 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=7019, Invalid=28137, Unknown=0, NotChecked=0, Total=35156 [2024-11-10 00:53:34,653 INFO L432 NwaCegarLoop]: 2224 mSDtfsCounter, 42127 mSDsluCounter, 29021 mSDsCounter, 0 mSdLazyCounter, 4411 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42127 SdHoareTripleChecker+Valid, 31245 SdHoareTripleChecker+Invalid, 4570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 4411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:34,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42127 Valid, 31245 Invalid, 4570 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [159 Valid, 4411 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-10 00:53:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29064 states. [2024-11-10 00:53:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29064 to 10535. [2024-11-10 00:53:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10535 states, 10533 states have (on average 1.7051172505459034) internal successors, (17960), 10534 states have internal predecessors, (17960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:53:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10535 states to 10535 states and 17960 transitions. [2024-11-10 00:53:35,019 INFO L78 Accepts]: Start accepts. Automaton has 10535 states and 17960 transitions. Word has length 80 [2024-11-10 00:53:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:35,019 INFO L471 AbstractCegarLoop]: Abstraction has 10535 states and 17960 transitions. [2024-11-10 00:53:35,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.3230769230769233) internal successors, (216), 65 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:53:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 10535 states and 17960 transitions. [2024-11-10 00:53:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:53:35,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:35,021 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, 1, 1] [2024-11-10 00:53:35,036 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:53:35,224 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:53:35,225 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:35,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:35,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1686425291, now seen corresponding path program 1 times [2024-11-10 00:53:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:35,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499669502] [2024-11-10 00:53:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:35,951 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:53:35,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:35,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499669502] [2024-11-10 00:53:35,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499669502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:53:35,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515193214] [2024-11-10 00:53:35,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:35,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:53:35,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:53:35,954 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:53:35,955 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:53:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:36,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 00:53:36,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:53:36,871 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:53:36,871 INFO L311 TraceCheckSpWp]: Computing backward predicates...