./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.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.1.ufo.BOUNDED-8.pals+Problem12_label01.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 f34e139d311e566fb184ea47633b96986afa15e7a6ae2ebeede6340c715d2189 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:49:06,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:49:06,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:49:06,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:49:06,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:49:06,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:49:06,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:49:06,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:49:06,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:49:06,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:49:06,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:49:06,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:49:06,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:49:06,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:49:06,660 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:49:06,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:49:06,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:49:06,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:49:06,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:49:06,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:49:06,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:49:06,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:49:06,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:49:06,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:49:06,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:49:06,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:49:06,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:49:06,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:49:06,665 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:49:06,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:49:06,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:49:06,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:49:06,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:49:06,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:49:06,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:49:06,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:49:06,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:49:06,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:49:06,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:49:06,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:49:06,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:49:06,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:49:06,668 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 -> f34e139d311e566fb184ea47633b96986afa15e7a6ae2ebeede6340c715d2189 [2024-11-10 00:49:06,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:49:06,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:49:06,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:49:06,881 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:49:06,881 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:49:06,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c [2024-11-10 00:49:08,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:49:08,409 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:49:08,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c [2024-11-10 00:49:08,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8611e08/a6f29e09e2864642bdbbc9e386de2217/FLAGeca5d0e2a [2024-11-10 00:49:08,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8611e08/a6f29e09e2864642bdbbc9e386de2217 [2024-11-10 00:49:08,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:49:08,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:49:08,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:49:08,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:49:08,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:49:08,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:08" (1/1) ... [2024-11-10 00:49:08,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5131a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:08, skipping insertion in model container [2024-11-10 00:49:08,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:08" (1/1) ... [2024-11-10 00:49:08,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:49:08,939 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.1.ufo.BOUNDED-8.pals+Problem12_label01.c[8653,8666] [2024-11-10 00:49:08,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c[14208,14221] [2024-11-10 00:49:09,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:49:09,507 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:49:09,525 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.1.ufo.BOUNDED-8.pals+Problem12_label01.c[8653,8666] [2024-11-10 00:49:09,530 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.1.ufo.BOUNDED-8.pals+Problem12_label01.c[14208,14221] [2024-11-10 00:49:09,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:49:09,811 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:49:09,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09 WrapperNode [2024-11-10 00:49:09,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:49:09,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:49:09,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:49:09,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:49:09,817 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:49:09" (1/1) ... [2024-11-10 00:49:09,854 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:49:09" (1/1) ... [2024-11-10 00:49:10,077 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5038 [2024-11-10 00:49:10,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:49:10,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:49:10,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:49:10,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:49:10,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,268 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:49:10,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:49:10,492 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:49:10,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:49:10,493 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:49:10,494 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:49:10,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:10,521 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:49:10,526 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:49:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:49:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:49:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:49:10,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:49:10,639 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:49:10,641 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:49:14,516 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5022: havoc calculate_output3_#t~ret36#1; [2024-11-10 00:49:14,517 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2053: havoc calculate_output_#t~ret34#1; [2024-11-10 00:49:14,517 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3532: havoc calculate_output2_#t~ret35#1; [2024-11-10 00:49:14,701 INFO L? ?]: Removed 2074 outVars from TransFormulas that were not future-live. [2024-11-10 00:49:14,701 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:49:14,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:49:14,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:49:14,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:49:14 BoogieIcfgContainer [2024-11-10 00:49:14,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:49:14,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:49:14,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:49:14,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:49:14,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:49:08" (1/3) ... [2024-11-10 00:49:14,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48397299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:49:14, skipping insertion in model container [2024-11-10 00:49:14,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (2/3) ... [2024-11-10 00:49:14,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48397299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:49:14, skipping insertion in model container [2024-11-10 00:49:14,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:49:14" (3/3) ... [2024-11-10 00:49:14,777 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label01.c [2024-11-10 00:49:14,789 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:49:14,790 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:49:14,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:49:14,873 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;@1de10ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:49:14,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:49:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 892 states, 889 states have (on average 2.6636670416197976) internal successors, (2368), 891 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:49:14,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:14,890 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:49:14,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:14,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash -576025244, now seen corresponding path program 1 times [2024-11-10 00:49:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8834005] [2024-11-10 00:49:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:15,094 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:49:15,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:15,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8834005] [2024-11-10 00:49:15,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8834005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:15,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:15,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:49:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47115469] [2024-11-10 00:49:15,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:15,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:49:15,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:15,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:49:15,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:49:15,124 INFO L87 Difference]: Start difference. First operand has 892 states, 889 states have (on average 2.6636670416197976) internal successors, (2368), 891 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:15,197 INFO L93 Difference]: Finished difference Result 1753 states and 4680 transitions. [2024-11-10 00:49:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:49:15,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 00:49:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:15,214 INFO L225 Difference]: With dead ends: 1753 [2024-11-10 00:49:15,215 INFO L226 Difference]: Without dead ends: 824 [2024-11-10 00:49:15,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:49:15,223 INFO L432 NwaCegarLoop]: 2300 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:15,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-11-10 00:49:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-11-10 00:49:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 822 states have (on average 2.71654501216545) internal successors, (2233), 823 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2233 transitions. [2024-11-10 00:49:15,295 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2233 transitions. Word has length 24 [2024-11-10 00:49:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:15,295 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 2233 transitions. [2024-11-10 00:49:15,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2233 transitions. [2024-11-10 00:49:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:49:15,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:15,297 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:49:15,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:49:15,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:15,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1573097597, now seen corresponding path program 1 times [2024-11-10 00:49:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:15,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819821453] [2024-11-10 00:49:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:15,447 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:49:15,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819821453] [2024-11-10 00:49:15,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819821453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:15,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:15,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:15,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287278207] [2024-11-10 00:49:15,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:15,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:15,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:15,452 INFO L87 Difference]: Start difference. First operand 824 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:15,555 INFO L93 Difference]: Finished difference Result 906 states and 2357 transitions. [2024-11-10 00:49:15,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:15,556 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:49:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:15,560 INFO L225 Difference]: With dead ends: 906 [2024-11-10 00:49:15,560 INFO L226 Difference]: Without dead ends: 863 [2024-11-10 00:49:15,561 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:49:15,562 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 59 mSDsluCounter, 6658 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 8887 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:15,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 8887 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:49:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-10 00:49:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 824. [2024-11-10 00:49:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 822 states have (on average 2.6885644768856447) internal successors, (2210), 823 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2210 transitions. [2024-11-10 00:49:15,590 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2210 transitions. Word has length 24 [2024-11-10 00:49:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:15,591 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 2210 transitions. [2024-11-10 00:49:15,591 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:49:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2210 transitions. [2024-11-10 00:49:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 00:49:15,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:15,592 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:49:15,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:49:15,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:15,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash 67352845, now seen corresponding path program 1 times [2024-11-10 00:49:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173377717] [2024-11-10 00:49:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:15,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:15,800 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:49:15,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173377717] [2024-11-10 00:49:15,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173377717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:15,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:15,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:49:15,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559433905] [2024-11-10 00:49:15,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:15,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:49:15,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:15,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:49:15,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:49:15,805 INFO L87 Difference]: Start difference. First operand 824 states and 2210 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:15,972 INFO L93 Difference]: Finished difference Result 1136 states and 2690 transitions. [2024-11-10 00:49:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:49:15,973 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:49:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:15,977 INFO L225 Difference]: With dead ends: 1136 [2024-11-10 00:49:15,977 INFO L226 Difference]: Without dead ends: 1097 [2024-11-10 00:49:15,978 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:49:15,979 INFO L432 NwaCegarLoop]: 2206 mSDtfsCounter, 8967 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8967 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:15,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8967 Valid, 3042 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:49:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-10 00:49:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 860. [2024-11-10 00:49:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 2.641025641025641) internal successors, (2266), 859 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2266 transitions. [2024-11-10 00:49:16,000 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2266 transitions. Word has length 46 [2024-11-10 00:49:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:16,001 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 2266 transitions. [2024-11-10 00:49:16,001 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:49:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2266 transitions. [2024-11-10 00:49:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 00:49:16,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:16,003 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:49:16,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:49:16,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1704032145, now seen corresponding path program 1 times [2024-11-10 00:49:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:16,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105060922] [2024-11-10 00:49:16,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:16,202 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:49:16,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:16,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105060922] [2024-11-10 00:49:16,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105060922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:16,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:16,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:49:16,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880465359] [2024-11-10 00:49:16,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:16,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:49:16,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:49:16,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:49:16,204 INFO L87 Difference]: Start difference. First operand 860 states and 2266 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:16,297 INFO L93 Difference]: Finished difference Result 938 states and 2384 transitions. [2024-11-10 00:49:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:49:16,298 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:49:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:16,301 INFO L225 Difference]: With dead ends: 938 [2024-11-10 00:49:16,301 INFO L226 Difference]: Without dead ends: 863 [2024-11-10 00:49:16,301 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:49:16,302 INFO L432 NwaCegarLoop]: 2204 mSDtfsCounter, 8660 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8660 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:16,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8660 Valid, 2372 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-10 00:49:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 860. [2024-11-10 00:49:16,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 2.63986013986014) internal successors, (2265), 859 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2265 transitions. [2024-11-10 00:49:16,316 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2265 transitions. Word has length 48 [2024-11-10 00:49:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:16,316 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 2265 transitions. [2024-11-10 00:49:16,316 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:49:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2265 transitions. [2024-11-10 00:49:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 00:49:16,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:16,317 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:49:16,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:49:16,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:16,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:16,318 INFO L85 PathProgramCache]: Analyzing trace with hash 438430262, now seen corresponding path program 1 times [2024-11-10 00:49:16,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:16,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725366975] [2024-11-10 00:49:16,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:16,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:16,370 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:49:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725366975] [2024-11-10 00:49:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725366975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967681132] [2024-11-10 00:49:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:16,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:16,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:16,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:16,374 INFO L87 Difference]: Start difference. First operand 860 states and 2265 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:16,403 INFO L93 Difference]: Finished difference Result 998 states and 2475 transitions. [2024-11-10 00:49:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:16,403 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:49:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:16,408 INFO L225 Difference]: With dead ends: 998 [2024-11-10 00:49:16,408 INFO L226 Difference]: Without dead ends: 923 [2024-11-10 00:49:16,408 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:49:16,409 INFO L432 NwaCegarLoop]: 2216 mSDtfsCounter, 2158 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:16,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2271 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-10 00:49:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2024-11-10 00:49:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 918 states have (on average 2.565359477124183) internal successors, (2355), 919 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2355 transitions. [2024-11-10 00:49:16,424 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2355 transitions. Word has length 49 [2024-11-10 00:49:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:16,424 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 2355 transitions. [2024-11-10 00:49:16,424 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:49:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2355 transitions. [2024-11-10 00:49:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:49:16,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:16,426 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:49:16,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:49:16,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:16,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1147349681, now seen corresponding path program 1 times [2024-11-10 00:49:16,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:16,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074224851] [2024-11-10 00:49:16,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:16,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:16,476 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:49:16,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:16,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074224851] [2024-11-10 00:49:16,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074224851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:16,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:16,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:16,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935191232] [2024-11-10 00:49:16,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:16,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:16,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:16,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:16,478 INFO L87 Difference]: Start difference. First operand 920 states and 2355 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:16,499 INFO L93 Difference]: Finished difference Result 1065 states and 2575 transitions. [2024-11-10 00:49:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:16,500 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:49:16,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:16,503 INFO L225 Difference]: With dead ends: 1065 [2024-11-10 00:49:16,503 INFO L226 Difference]: Without dead ends: 990 [2024-11-10 00:49:16,504 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:49:16,504 INFO L432 NwaCegarLoop]: 2254 mSDtfsCounter, 2170 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:16,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2315 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-10 00:49:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 987. [2024-11-10 00:49:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 985 states have (on average 2.4923857868020303) internal successors, (2455), 986 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2455 transitions. [2024-11-10 00:49:16,524 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2455 transitions. Word has length 50 [2024-11-10 00:49:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:16,524 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 2455 transitions. [2024-11-10 00:49:16,524 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:49:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2455 transitions. [2024-11-10 00:49:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:49:16,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:16,525 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:49:16,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:49:16,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:16,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:16,526 INFO L85 PathProgramCache]: Analyzing trace with hash 145939953, now seen corresponding path program 1 times [2024-11-10 00:49:16,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:16,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715185337] [2024-11-10 00:49:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:16,561 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:49:16,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:16,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715185337] [2024-11-10 00:49:16,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715185337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:16,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:16,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979199463] [2024-11-10 00:49:16,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:16,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:16,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:16,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:16,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:16,563 INFO L87 Difference]: Start difference. First operand 987 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:16,630 INFO L93 Difference]: Finished difference Result 1361 states and 3017 transitions. [2024-11-10 00:49:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:16,631 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:49:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:16,634 INFO L225 Difference]: With dead ends: 1361 [2024-11-10 00:49:16,634 INFO L226 Difference]: Without dead ends: 1162 [2024-11-10 00:49:16,635 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:49:16,635 INFO L432 NwaCegarLoop]: 2256 mSDtfsCounter, 2168 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:16,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 2321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-11-10 00:49:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1159. [2024-11-10 00:49:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1157 states have (on average 2.3396715643906654) internal successors, (2707), 1158 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2707 transitions. [2024-11-10 00:49:16,665 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2707 transitions. Word has length 50 [2024-11-10 00:49:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:16,665 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 2707 transitions. [2024-11-10 00:49:16,665 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:49:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2707 transitions. [2024-11-10 00:49:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:49:16,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:16,666 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:49:16,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:49:16,666 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:16,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash 131490097, now seen corresponding path program 1 times [2024-11-10 00:49:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282507672] [2024-11-10 00:49:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:16,707 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:49:16,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:16,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282507672] [2024-11-10 00:49:16,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282507672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:16,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:16,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:16,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972328994] [2024-11-10 00:49:16,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:16,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:16,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:16,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:16,709 INFO L87 Difference]: Start difference. First operand 1159 states and 2707 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:16,734 INFO L93 Difference]: Finished difference Result 1853 states and 3731 transitions. [2024-11-10 00:49:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:16,734 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:49:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:16,739 INFO L225 Difference]: With dead ends: 1853 [2024-11-10 00:49:16,739 INFO L226 Difference]: Without dead ends: 1482 [2024-11-10 00:49:16,739 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:49:16,740 INFO L432 NwaCegarLoop]: 2254 mSDtfsCounter, 2166 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:16,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 2323 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:16,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2024-11-10 00:49:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1479. [2024-11-10 00:49:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1477 states have (on average 2.1415030467163167) internal successors, (3163), 1478 states have internal predecessors, (3163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3163 transitions. [2024-11-10 00:49:16,764 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3163 transitions. Word has length 50 [2024-11-10 00:49:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:16,765 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 3163 transitions. [2024-11-10 00:49:16,765 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:49:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3163 transitions. [2024-11-10 00:49:16,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:49:16,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:16,766 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:49:16,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:49:16,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:16,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:16,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2071874447, now seen corresponding path program 1 times [2024-11-10 00:49:16,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:16,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95134100] [2024-11-10 00:49:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:16,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:16,803 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:49:16,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:16,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95134100] [2024-11-10 00:49:16,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95134100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:16,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:16,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211478325] [2024-11-10 00:49:16,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:16,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:16,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:16,806 INFO L87 Difference]: Start difference. First operand 1479 states and 3163 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:16,835 INFO L93 Difference]: Finished difference Result 2765 states and 5015 transitions. [2024-11-10 00:49:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:16,835 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:49:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:16,842 INFO L225 Difference]: With dead ends: 2765 [2024-11-10 00:49:16,842 INFO L226 Difference]: Without dead ends: 2074 [2024-11-10 00:49:16,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:49:16,844 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 2164 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:16,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 2325 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2024-11-10 00:49:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2071. [2024-11-10 00:49:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2069 states have (on average 1.9231512808119864) internal successors, (3979), 2070 states have internal predecessors, (3979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3979 transitions. [2024-11-10 00:49:16,877 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3979 transitions. Word has length 50 [2024-11-10 00:49:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:16,878 INFO L471 AbstractCegarLoop]: Abstraction has 2071 states and 3979 transitions. [2024-11-10 00:49:16,878 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:49:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3979 transitions. [2024-11-10 00:49:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:49:16,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:16,878 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:49:16,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:49:16,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:16,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1698815794, now seen corresponding path program 1 times [2024-11-10 00:49:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341996794] [2024-11-10 00:49:16,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:17,000 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:49:17,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:17,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341996794] [2024-11-10 00:49:17,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341996794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:17,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:17,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:17,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254508739] [2024-11-10 00:49:17,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:17,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:17,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:17,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:17,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:17,007 INFO L87 Difference]: Start difference. First operand 2071 states and 3979 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:17,048 INFO L93 Difference]: Finished difference Result 2170 states and 4109 transitions. [2024-11-10 00:49:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:17,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:49:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:17,055 INFO L225 Difference]: With dead ends: 2170 [2024-11-10 00:49:17,055 INFO L226 Difference]: Without dead ends: 2167 [2024-11-10 00:49:17,056 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:49:17,056 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 0 mSDsluCounter, 6612 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8819 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:17,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8819 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2024-11-10 00:49:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2167. [2024-11-10 00:49:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2165 states have (on average 1.8785219399538107) internal successors, (4067), 2166 states have internal predecessors, (4067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 4067 transitions. [2024-11-10 00:49:17,089 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 4067 transitions. Word has length 50 [2024-11-10 00:49:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:17,089 INFO L471 AbstractCegarLoop]: Abstraction has 2167 states and 4067 transitions. [2024-11-10 00:49:17,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 4067 transitions. [2024-11-10 00:49:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:49:17,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:17,090 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:49:17,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:49:17,090 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:17,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2030651655, now seen corresponding path program 1 times [2024-11-10 00:49:17,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:17,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173956547] [2024-11-10 00:49:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:17,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:17,127 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:49:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:17,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173956547] [2024-11-10 00:49:17,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173956547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:17,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:17,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:49:17,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197863984] [2024-11-10 00:49:17,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:17,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:17,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:17,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:17,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:17,129 INFO L87 Difference]: Start difference. First operand 2167 states and 4067 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 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:49:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:20,550 INFO L93 Difference]: Finished difference Result 3674 states and 8303 transitions. [2024-11-10 00:49:20,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:20,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 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:49:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:20,558 INFO L225 Difference]: With dead ends: 3674 [2024-11-10 00:49:20,558 INFO L226 Difference]: Without dead ends: 2919 [2024-11-10 00:49:20,559 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:49:20,560 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1536 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3637 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 3637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:20,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 170 Invalid, 4635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 3637 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-10 00:49:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2024-11-10 00:49:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2919. [2024-11-10 00:49:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2917 states have (on average 2.0990743914981147) internal successors, (6123), 2918 states have internal predecessors, (6123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 6123 transitions. [2024-11-10 00:49:20,607 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 6123 transitions. Word has length 50 [2024-11-10 00:49:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:20,607 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 6123 transitions. [2024-11-10 00:49:20,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 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:49:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 6123 transitions. [2024-11-10 00:49:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:49:20,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:20,608 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:49:20,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:49:20,608 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:20,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:20,609 INFO L85 PathProgramCache]: Analyzing trace with hash -26766179, now seen corresponding path program 1 times [2024-11-10 00:49:20,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:20,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104109241] [2024-11-10 00:49:20,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:20,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:20,711 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:49:20,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:20,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104109241] [2024-11-10 00:49:20,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104109241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:20,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:20,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:49:20,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596560535] [2024-11-10 00:49:20,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:20,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:49:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:20,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:49:20,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:49:20,713 INFO L87 Difference]: Start difference. First operand 2919 states and 6123 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:20,835 INFO L93 Difference]: Finished difference Result 8366 states and 13669 transitions. [2024-11-10 00:49:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:49:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:49:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:20,864 INFO L225 Difference]: With dead ends: 8366 [2024-11-10 00:49:20,864 INFO L226 Difference]: Without dead ends: 7371 [2024-11-10 00:49:20,868 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:49:20,868 INFO L432 NwaCegarLoop]: 2265 mSDtfsCounter, 6710 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6710 SdHoareTripleChecker+Valid, 4763 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:20,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6710 Valid, 4763 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7371 states. [2024-11-10 00:49:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7371 to 4111. [2024-11-10 00:49:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4111 states, 4109 states have (on average 1.8873205159406181) internal successors, (7755), 4110 states have internal predecessors, (7755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 7755 transitions. [2024-11-10 00:49:20,996 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 7755 transitions. Word has length 69 [2024-11-10 00:49:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:20,996 INFO L471 AbstractCegarLoop]: Abstraction has 4111 states and 7755 transitions. [2024-11-10 00:49:20,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 7755 transitions. [2024-11-10 00:49:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:49:20,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:20,998 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:49:20,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:49:20,998 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:20,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1028175907, now seen corresponding path program 1 times [2024-11-10 00:49:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630121840] [2024-11-10 00:49:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:21,090 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:49:21,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:21,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630121840] [2024-11-10 00:49:21,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630121840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:21,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:21,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:49:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796001840] [2024-11-10 00:49:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:21,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:49:21,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:21,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:49:21,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:49:21,091 INFO L87 Difference]: Start difference. First operand 4111 states and 7755 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:49:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:21,223 INFO L93 Difference]: Finished difference Result 9742 states and 15565 transitions. [2024-11-10 00:49:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:49:21,224 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:49:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:21,236 INFO L225 Difference]: With dead ends: 9742 [2024-11-10 00:49:21,236 INFO L226 Difference]: Without dead ends: 8363 [2024-11-10 00:49:21,239 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:49:21,240 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 6709 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6709 SdHoareTripleChecker+Valid, 4740 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:21,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6709 Valid, 4740 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8363 states. [2024-11-10 00:49:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8363 to 5983. [2024-11-10 00:49:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5981 states have (on average 1.7246279886306637) internal successors, (10315), 5982 states have internal predecessors, (10315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 10315 transitions. [2024-11-10 00:49:21,344 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 10315 transitions. Word has length 69 [2024-11-10 00:49:21,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:21,345 INFO L471 AbstractCegarLoop]: Abstraction has 5983 states and 10315 transitions. [2024-11-10 00:49:21,345 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:49:21,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 10315 transitions. [2024-11-10 00:49:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:49:21,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:21,347 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:49:21,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:49:21,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:21,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1042625763, now seen corresponding path program 1 times [2024-11-10 00:49:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17657496] [2024-11-10 00:49:21,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:21,430 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:49:21,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:21,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17657496] [2024-11-10 00:49:21,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17657496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:21,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:21,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:49:21,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385287958] [2024-11-10 00:49:21,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:21,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:49:21,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:21,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:49:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:49:21,433 INFO L87 Difference]: Start difference. First operand 5983 states and 10315 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:49:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:21,579 INFO L93 Difference]: Finished difference Result 11118 states and 17453 transitions. [2024-11-10 00:49:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:49:21,579 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:49:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:21,592 INFO L225 Difference]: With dead ends: 11118 [2024-11-10 00:49:21,593 INFO L226 Difference]: Without dead ends: 9739 [2024-11-10 00:49:21,596 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:49:21,597 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 6733 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6733 SdHoareTripleChecker+Valid, 4724 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:21,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6733 Valid, 4724 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2024-11-10 00:49:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 7359. [2024-11-10 00:49:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7359 states, 7357 states have (on average 1.6586924017942095) internal successors, (12203), 7358 states have internal predecessors, (12203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7359 states to 7359 states and 12203 transitions. [2024-11-10 00:49:21,804 INFO L78 Accepts]: Start accepts. Automaton has 7359 states and 12203 transitions. Word has length 69 [2024-11-10 00:49:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:21,804 INFO L471 AbstractCegarLoop]: Abstraction has 7359 states and 12203 transitions. [2024-11-10 00:49:21,804 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:49:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 7359 states and 12203 transitions. [2024-11-10 00:49:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:49:21,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:21,807 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:49:21,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:49:21,807 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:21,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:21,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1048976989, now seen corresponding path program 1 times [2024-11-10 00:49:21,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:21,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441886670] [2024-11-10 00:49:21,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:21,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:21,917 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:49:21,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:21,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441886670] [2024-11-10 00:49:21,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441886670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:21,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:21,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:49:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695406005] [2024-11-10 00:49:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:21,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:49:21,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:21,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:49:21,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:49:21,919 INFO L87 Difference]: Start difference. First operand 7359 states and 12203 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:49:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:22,145 INFO L93 Difference]: Finished difference Result 12494 states and 19341 transitions. [2024-11-10 00:49:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:49:22,146 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:49:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:22,164 INFO L225 Difference]: With dead ends: 12494 [2024-11-10 00:49:22,164 INFO L226 Difference]: Without dead ends: 11115 [2024-11-10 00:49:22,169 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:49:22,169 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 6721 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6721 SdHoareTripleChecker+Valid, 4764 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:22,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6721 Valid, 4764 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:49:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11115 states. [2024-11-10 00:49:22,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11115 to 8735. [2024-11-10 00:49:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8735 states, 8733 states have (on average 1.6135348677430437) internal successors, (14091), 8734 states have internal predecessors, (14091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 14091 transitions. [2024-11-10 00:49:22,369 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 14091 transitions. Word has length 69 [2024-11-10 00:49:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:22,370 INFO L471 AbstractCegarLoop]: Abstraction has 8735 states and 14091 transitions. [2024-11-10 00:49:22,370 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:49:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 14091 transitions. [2024-11-10 00:49:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:49:22,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:22,372 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:49:22,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:49:22,372 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:22,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:22,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1958100993, now seen corresponding path program 1 times [2024-11-10 00:49:22,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:22,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993643318] [2024-11-10 00:49:22,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:22,466 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:49:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993643318] [2024-11-10 00:49:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993643318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:22,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463406108] [2024-11-10 00:49:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:22,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:22,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:22,468 INFO L87 Difference]: Start difference. First operand 8735 states and 14091 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:49:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:22,550 INFO L93 Difference]: Finished difference Result 15933 states and 23975 transitions. [2024-11-10 00:49:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:22,551 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:49:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:22,563 INFO L225 Difference]: With dead ends: 15933 [2024-11-10 00:49:22,563 INFO L226 Difference]: Without dead ends: 8738 [2024-11-10 00:49:22,570 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:49:22,570 INFO L432 NwaCegarLoop]: 2238 mSDtfsCounter, 36 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4436 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:22,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4436 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8738 states. [2024-11-10 00:49:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8738 to 8735. [2024-11-10 00:49:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8735 states, 8733 states have (on average 1.5993358525134547) internal successors, (13967), 8734 states have internal predecessors, (13967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 13967 transitions. [2024-11-10 00:49:22,693 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 13967 transitions. Word has length 71 [2024-11-10 00:49:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:22,693 INFO L471 AbstractCegarLoop]: Abstraction has 8735 states and 13967 transitions. [2024-11-10 00:49:22,693 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:49:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 13967 transitions. [2024-11-10 00:49:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:49:22,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:22,695 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:49:22,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:49:22,695 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:22,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2054791999, now seen corresponding path program 1 times [2024-11-10 00:49:22,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:22,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706287221] [2024-11-10 00:49:22,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:22,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:22,764 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:49:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706287221] [2024-11-10 00:49:22,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706287221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:22,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:22,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:22,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419586071] [2024-11-10 00:49:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:22,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:22,766 INFO L87 Difference]: Start difference. First operand 8735 states and 13967 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:49:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:22,850 INFO L93 Difference]: Finished difference Result 11488 states and 17731 transitions. [2024-11-10 00:49:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:22,850 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:49:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:22,857 INFO L225 Difference]: With dead ends: 11488 [2024-11-10 00:49:22,857 INFO L226 Difference]: Without dead ends: 4293 [2024-11-10 00:49:22,863 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:49:22,863 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 32 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:22,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4433 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2024-11-10 00:49:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 4283. [2024-11-10 00:49:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4283 states, 4281 states have (on average 1.8498014482597525) internal successors, (7919), 4282 states have internal predecessors, (7919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 7919 transitions. [2024-11-10 00:49:22,923 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 7919 transitions. Word has length 71 [2024-11-10 00:49:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:22,923 INFO L471 AbstractCegarLoop]: Abstraction has 4283 states and 7919 transitions. [2024-11-10 00:49:22,923 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:49:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 7919 transitions. [2024-11-10 00:49:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:49:22,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:22,924 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:22,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:49:22,925 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:22,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash 798912897, now seen corresponding path program 1 times [2024-11-10 00:49:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:22,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436216807] [2024-11-10 00:49:22,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:22,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:22,988 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:49:22,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:22,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436216807] [2024-11-10 00:49:22,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436216807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:22,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:22,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:22,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998508627] [2024-11-10 00:49:22,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:22,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:22,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:22,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:22,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:22,990 INFO L87 Difference]: Start difference. First operand 4283 states and 7919 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:49:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:23,021 INFO L93 Difference]: Finished difference Result 5653 states and 9771 transitions. [2024-11-10 00:49:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:23,021 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:49:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:23,026 INFO L225 Difference]: With dead ends: 5653 [2024-11-10 00:49:23,026 INFO L226 Difference]: Without dead ends: 2922 [2024-11-10 00:49:23,028 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:49:23,028 INFO L432 NwaCegarLoop]: 2230 mSDtfsCounter, 30 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4412 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:23,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4412 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2024-11-10 00:49:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2919. [2024-11-10 00:49:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2917 states have (on average 2.0737058621871785) internal successors, (6049), 2918 states have internal predecessors, (6049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 6049 transitions. [2024-11-10 00:49:23,062 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 6049 transitions. Word has length 73 [2024-11-10 00:49:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:23,062 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 6049 transitions. [2024-11-10 00:49:23,062 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:49:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 6049 transitions. [2024-11-10 00:49:23,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:49:23,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:23,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:23,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:49:23,064 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:23,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1102118600, now seen corresponding path program 1 times [2024-11-10 00:49:23,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691018053] [2024-11-10 00:49:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:23,121 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:49:23,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:23,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691018053] [2024-11-10 00:49:23,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691018053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:23,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:23,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590912454] [2024-11-10 00:49:23,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:23,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:23,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:23,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:23,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:23,123 INFO L87 Difference]: Start difference. First operand 2919 states and 6049 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:49:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:23,149 INFO L93 Difference]: Finished difference Result 3607 states and 6966 transitions. [2024-11-10 00:49:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:23,150 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:49:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:23,153 INFO L225 Difference]: With dead ends: 3607 [2024-11-10 00:49:23,153 INFO L226 Difference]: Without dead ends: 2240 [2024-11-10 00:49:23,155 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:49:23,155 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 27 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4397 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:23,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4397 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-11-10 00:49:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2237. [2024-11-10 00:49:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2235 states have (on average 2.2930648769574944) internal successors, (5125), 2236 states have internal predecessors, (5125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 5125 transitions. [2024-11-10 00:49:23,179 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 5125 transitions. Word has length 75 [2024-11-10 00:49:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:23,179 INFO L471 AbstractCegarLoop]: Abstraction has 2237 states and 5125 transitions. [2024-11-10 00:49:23,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:49:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 5125 transitions. [2024-11-10 00:49:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:49:23,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:23,180 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:23,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:49:23,180 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:23,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:23,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1394283217, now seen corresponding path program 1 times [2024-11-10 00:49:23,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:23,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593941668] [2024-11-10 00:49:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:23,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:23,435 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:49:23,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:23,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593941668] [2024-11-10 00:49:23,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593941668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:23,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441695787] [2024-11-10 00:49:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:23,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:23,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:23,438 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:49:23,438 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:49:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:23,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:49:23,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:23,988 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:49:23,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:24,616 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:49:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441695787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:24,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:24,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-10 00:49:24,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058809057] [2024-11-10 00:49:24,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:24,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 00:49:24,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:24,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 00:49:24,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-11-10 00:49:24,618 INFO L87 Difference]: Start difference. First operand 2237 states and 5125 transitions. Second operand has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 25 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:49:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:25,491 INFO L93 Difference]: Finished difference Result 4408 states and 7995 transitions. [2024-11-10 00:49:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 00:49:25,492 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 25 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 00:49:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:25,497 INFO L225 Difference]: With dead ends: 4408 [2024-11-10 00:49:25,497 INFO L226 Difference]: Without dead ends: 3723 [2024-11-10 00:49:25,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 00:49:25,499 INFO L432 NwaCegarLoop]: 2178 mSDtfsCounter, 28891 mSDsluCounter, 9110 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28891 SdHoareTripleChecker+Valid, 11288 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:25,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28891 Valid, 11288 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:49:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2024-11-10 00:49:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3700. [2024-11-10 00:49:25,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 3698 states have (on average 1.8945375878853434) internal successors, (7006), 3699 states have internal predecessors, (7006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 7006 transitions. [2024-11-10 00:49:25,549 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 7006 transitions. Word has length 77 [2024-11-10 00:49:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:25,549 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 7006 transitions. [2024-11-10 00:49:25,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.115384615384615) internal successors, (211), 25 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:49:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 7006 transitions. [2024-11-10 00:49:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:49:25,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:25,551 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:25,565 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:49:25,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:25,755 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:25,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1476797615, now seen corresponding path program 1 times [2024-11-10 00:49:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106453258] [2024-11-10 00:49:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:26,697 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:49:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106453258] [2024-11-10 00:49:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106453258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303233437] [2024-11-10 00:49:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:26,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:26,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:26,698 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:49:26,699 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:49:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:26,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 00:49:26,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:27,408 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:49:27,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:27,998 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:49:27,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303233437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:27,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:27,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2024-11-10 00:49:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291186496] [2024-11-10 00:49:27,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:27,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 00:49:27,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:28,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 00:49:28,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 00:49:28,000 INFO L87 Difference]: Start difference. First operand 3700 states and 7006 transitions. Second operand has 33 states, 33 states have (on average 6.090909090909091) internal successors, (201), 33 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:30,733 INFO L93 Difference]: Finished difference Result 7847 states and 12370 transitions. [2024-11-10 00:49:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-10 00:49:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.090909090909091) internal successors, (201), 33 states have internal predecessors, (201), 0 states have call successors, (0), 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:49:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:30,741 INFO L225 Difference]: With dead ends: 7847 [2024-11-10 00:49:30,741 INFO L226 Difference]: Without dead ends: 5699 [2024-11-10 00:49:30,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1037, Invalid=4815, Unknown=0, NotChecked=0, Total=5852 [2024-11-10 00:49:30,745 INFO L432 NwaCegarLoop]: 2198 mSDtfsCounter, 25406 mSDsluCounter, 20154 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25406 SdHoareTripleChecker+Valid, 22352 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:30,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25406 Valid, 22352 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:49:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2024-11-10 00:49:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5619. [2024-11-10 00:49:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5619 states, 5617 states have (on average 1.6813245504717822) internal successors, (9444), 5618 states have internal predecessors, (9444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 9444 transitions. [2024-11-10 00:49:30,834 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 9444 transitions. Word has length 77 [2024-11-10 00:49:30,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:30,834 INFO L471 AbstractCegarLoop]: Abstraction has 5619 states and 9444 transitions. [2024-11-10 00:49:30,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.090909090909091) internal successors, (201), 33 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 9444 transitions. [2024-11-10 00:49:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:49:30,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:30,835 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:30,847 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:49:31,035 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:49:31,035 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:31,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash -715664882, now seen corresponding path program 1 times [2024-11-10 00:49:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:31,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819290666] [2024-11-10 00:49:31,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:31,378 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:49:31,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:31,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819290666] [2024-11-10 00:49:31,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819290666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:31,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627036743] [2024-11-10 00:49:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:31,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:31,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:31,381 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:49:31,383 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:49:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:31,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:49:31,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:31,766 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:49:31,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:32,159 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:49:32,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627036743] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:32,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:32,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-10 00:49:32,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826602731] [2024-11-10 00:49:32,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:32,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 00:49:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:32,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 00:49:32,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:49:32,160 INFO L87 Difference]: Start difference. First operand 5619 states and 9444 transitions. Second operand has 21 states, 21 states have (on average 7.857142857142857) internal successors, (165), 20 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:32,587 INFO L93 Difference]: Finished difference Result 8642 states and 13376 transitions. [2024-11-10 00:49:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:49:32,588 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.857142857142857) internal successors, (165), 20 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-10 00:49:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:32,596 INFO L225 Difference]: With dead ends: 8642 [2024-11-10 00:49:32,596 INFO L226 Difference]: Without dead ends: 5811 [2024-11-10 00:49:32,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2024-11-10 00:49:32,600 INFO L432 NwaCegarLoop]: 2185 mSDtfsCounter, 19934 mSDsluCounter, 4630 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19934 SdHoareTripleChecker+Valid, 6815 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:32,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19934 Valid, 6815 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:49:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5811 states. [2024-11-10 00:49:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5811 to 5719. [2024-11-10 00:49:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5719 states, 5717 states have (on average 1.6683575301731677) internal successors, (9538), 5718 states have internal predecessors, (9538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 9538 transitions. [2024-11-10 00:49:32,693 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 9538 transitions. Word has length 78 [2024-11-10 00:49:32,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:32,693 INFO L471 AbstractCegarLoop]: Abstraction has 5719 states and 9538 transitions. [2024-11-10 00:49:32,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.857142857142857) internal successors, (165), 20 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 9538 transitions. [2024-11-10 00:49:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 00:49:32,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:32,694 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:32,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:49:32,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:32,895 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:32,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash -818271186, now seen corresponding path program 1 times [2024-11-10 00:49:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:32,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771991959] [2024-11-10 00:49:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:33,237 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:49:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771991959] [2024-11-10 00:49:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771991959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603532675] [2024-11-10 00:49:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:33,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:33,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:49:33,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:49:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:33,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:49:33,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:33,592 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:49:33,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:34,114 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:49:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603532675] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:34,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-10 00:49:34,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120815092] [2024-11-10 00:49:34,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:34,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 00:49:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 00:49:34,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:49:34,115 INFO L87 Difference]: Start difference. First operand 5719 states and 9538 transitions. Second operand has 21 states, 21 states have (on average 7.571428571428571) internal successors, (159), 20 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:34,571 INFO L93 Difference]: Finished difference Result 14143 states and 20352 transitions. [2024-11-10 00:49:34,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:49:34,571 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.571428571428571) internal successors, (159), 20 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-10 00:49:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:34,581 INFO L225 Difference]: With dead ends: 14143 [2024-11-10 00:49:34,581 INFO L226 Difference]: Without dead ends: 9976 [2024-11-10 00:49:34,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2024-11-10 00:49:34,587 INFO L432 NwaCegarLoop]: 2191 mSDtfsCounter, 19783 mSDsluCounter, 6811 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19783 SdHoareTripleChecker+Valid, 9002 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:34,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19783 Valid, 9002 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:49:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9976 states. [2024-11-10 00:49:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9976 to 7115. [2024-11-10 00:49:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7115 states, 7113 states have (on average 1.5914522704906509) internal successors, (11320), 7114 states have internal predecessors, (11320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7115 states to 7115 states and 11320 transitions. [2024-11-10 00:49:34,731 INFO L78 Accepts]: Start accepts. Automaton has 7115 states and 11320 transitions. Word has length 78 [2024-11-10 00:49:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:34,732 INFO L471 AbstractCegarLoop]: Abstraction has 7115 states and 11320 transitions. [2024-11-10 00:49:34,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.571428571428571) internal successors, (159), 20 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7115 states and 11320 transitions. [2024-11-10 00:49:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:49:34,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:34,733 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:49:34,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:49:34,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:34,934 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:34,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash -114225462, now seen corresponding path program 1 times [2024-11-10 00:49:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:34,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668615056] [2024-11-10 00:49:34,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:35,644 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:49:35,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:35,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668615056] [2024-11-10 00:49:35,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668615056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:35,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51698509] [2024-11-10 00:49:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:35,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:35,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:35,646 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:49:35,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:49:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:35,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 00:49:35,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:38,370 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:49:38,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:42,388 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:49:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51698509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:42,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:42,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23, 22] total 51 [2024-11-10 00:49:42,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791195466] [2024-11-10 00:49:42,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:42,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-10 00:49:42,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 00:49:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2210, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 00:49:42,390 INFO L87 Difference]: Start difference. First operand 7115 states and 11320 transitions. Second operand has 51 states, 51 states have (on average 4.176470588235294) internal successors, (213), 51 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:48,730 INFO L93 Difference]: Finished difference Result 13760 states and 19613 transitions. [2024-11-10 00:49:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-10 00:49:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.176470588235294) internal successors, (213), 51 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-10 00:49:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:48,739 INFO L225 Difference]: With dead ends: 13760 [2024-11-10 00:49:48,739 INFO L226 Difference]: Without dead ends: 9899 [2024-11-10 00:49:48,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2755 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2030, Invalid=8682, Unknown=0, NotChecked=0, Total=10712 [2024-11-10 00:49:48,744 INFO L432 NwaCegarLoop]: 2201 mSDtfsCounter, 30979 mSDsluCounter, 31453 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30979 SdHoareTripleChecker+Valid, 33654 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:48,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30979 Valid, 33654 Invalid, 2121 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 00:49:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9899 states. [2024-11-10 00:49:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9899 to 7953. [2024-11-10 00:49:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7953 states, 7951 states have (on average 1.555150295560307) internal successors, (12365), 7952 states have internal predecessors, (12365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7953 states to 7953 states and 12365 transitions. [2024-11-10 00:49:48,898 INFO L78 Accepts]: Start accepts. Automaton has 7953 states and 12365 transitions. Word has length 79 [2024-11-10 00:49:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:48,898 INFO L471 AbstractCegarLoop]: Abstraction has 7953 states and 12365 transitions. [2024-11-10 00:49:48,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.176470588235294) internal successors, (213), 51 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 7953 states and 12365 transitions. [2024-11-10 00:49:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:49:48,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:48,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:48,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 00:49:49,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 00:49:49,104 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:49,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 236259826, now seen corresponding path program 1 times [2024-11-10 00:49:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660595999] [2024-11-10 00:49:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:49,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:50,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:50,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660595999] [2024-11-10 00:49:50,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660595999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:50,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686088650] [2024-11-10 00:49:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:50,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:50,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:50,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:49:50,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 00:49:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:50,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 00:49:50,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:50,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686088650] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:51,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:51,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 13] total 48 [2024-11-10 00:49:51,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847158705] [2024-11-10 00:49:51,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:51,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-10 00:49:51,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:51,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-10 00:49:51,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2100, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 00:49:51,713 INFO L87 Difference]: Start difference. First operand 7953 states and 12365 transitions. Second operand has 48 states, 48 states have (on average 4.333333333333333) internal successors, (208), 48 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:57,078 INFO L93 Difference]: Finished difference Result 19957 states and 27764 transitions. [2024-11-10 00:49:57,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-10 00:49:57,078 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.333333333333333) internal successors, (208), 48 states have internal predecessors, (208), 0 states have call successors, (0), 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:49:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:57,088 INFO L225 Difference]: With dead ends: 19957 [2024-11-10 00:49:57,089 INFO L226 Difference]: Without dead ends: 16306 [2024-11-10 00:49:57,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1836 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1500, Invalid=7056, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 00:49:57,092 INFO L432 NwaCegarLoop]: 2167 mSDtfsCounter, 31876 mSDsluCounter, 37176 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31876 SdHoareTripleChecker+Valid, 39343 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:57,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31876 Valid, 39343 Invalid, 2153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 00:49:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16306 states. [2024-11-10 00:49:57,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16306 to 7970. [2024-11-10 00:49:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7970 states, 7968 states have (on average 1.5543423694779117) internal successors, (12385), 7969 states have internal predecessors, (12385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 12385 transitions. [2024-11-10 00:49:57,292 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 12385 transitions. Word has length 80 [2024-11-10 00:49:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:57,293 INFO L471 AbstractCegarLoop]: Abstraction has 7970 states and 12385 transitions. [2024-11-10 00:49:57,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.333333333333333) internal successors, (208), 48 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 12385 transitions. [2024-11-10 00:49:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 00:49:57,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:57,294 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:57,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 00:49:57,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:57,494 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:57,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1924322355, now seen corresponding path program 1 times [2024-11-10 00:49:57,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:57,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55787866] [2024-11-10 00:49:57,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:57,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:49:57,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55787866] [2024-11-10 00:49:57,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55787866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582598790] [2024-11-10 00:49:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:57,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:57,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:57,613 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:49:57,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 00:49:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:57,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:49:57,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:49:57,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:49:57,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582598790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:57,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:57,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-11-10 00:49:57,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919057658] [2024-11-10 00:49:57,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:57,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:49:57,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:49:57,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:49:58,000 INFO L87 Difference]: Start difference. First operand 7970 states and 12385 transitions. Second operand has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:58,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:58,340 INFO L93 Difference]: Finished difference Result 17914 states and 24690 transitions. [2024-11-10 00:49:58,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:49:58,341 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 0 states have call successors, (0), 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 82 [2024-11-10 00:49:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:58,351 INFO L225 Difference]: With dead ends: 17914 [2024-11-10 00:49:58,352 INFO L226 Difference]: Without dead ends: 11527 [2024-11-10 00:49:58,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:49:58,358 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 6461 mSDsluCounter, 4534 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6461 SdHoareTripleChecker+Valid, 6739 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:58,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6461 Valid, 6739 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:58,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11527 states. [2024-11-10 00:49:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11527 to 10896. [2024-11-10 00:49:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10896 states, 10894 states have (on average 1.4328070497521572) internal successors, (15609), 10895 states have internal predecessors, (15609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10896 states to 10896 states and 15609 transitions. [2024-11-10 00:49:58,714 INFO L78 Accepts]: Start accepts. Automaton has 10896 states and 15609 transitions. Word has length 82 [2024-11-10 00:49:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:58,715 INFO L471 AbstractCegarLoop]: Abstraction has 10896 states and 15609 transitions. [2024-11-10 00:49:58,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 10896 states and 15609 transitions. [2024-11-10 00:49:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 00:49:58,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:58,717 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-10 00:49:58,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 00:49:58,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:58,922 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:58,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:58,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1647032092, now seen corresponding path program 1 times [2024-11-10 00:49:58,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661648563] [2024-11-10 00:49:58,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:58,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:58,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:58,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661648563] [2024-11-10 00:49:58,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661648563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:58,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:58,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:49:58,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388022116] [2024-11-10 00:49:58,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:58,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:58,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:58,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:58,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:58,973 INFO L87 Difference]: Start difference. First operand 10896 states and 15609 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:02,253 INFO L93 Difference]: Finished difference Result 13910 states and 23959 transitions. [2024-11-10 00:50:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:50:02,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-10 00:50:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:02,265 INFO L225 Difference]: With dead ends: 13910 [2024-11-10 00:50:02,265 INFO L226 Difference]: Without dead ends: 12403 [2024-11-10 00:50:02,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:50:02,269 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 1687 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 4219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:02,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 447 Invalid, 4219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-10 00:50:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12403 states. [2024-11-10 00:50:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12403 to 12400. [2024-11-10 00:50:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12400 states, 12398 states have (on average 1.542829488627198) internal successors, (19128), 12399 states have internal predecessors, (19128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12400 states to 12400 states and 19128 transitions. [2024-11-10 00:50:02,568 INFO L78 Accepts]: Start accepts. Automaton has 12400 states and 19128 transitions. Word has length 124 [2024-11-10 00:50:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:02,568 INFO L471 AbstractCegarLoop]: Abstraction has 12400 states and 19128 transitions. [2024-11-10 00:50:02,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 12400 states and 19128 transitions. [2024-11-10 00:50:02,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 00:50:02,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:02,572 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:02,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 00:50:02,572 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:02,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:02,572 INFO L85 PathProgramCache]: Analyzing trace with hash 623271430, now seen corresponding path program 1 times [2024-11-10 00:50:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:02,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873184167] [2024-11-10 00:50:02,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:02,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 33 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873184167] [2024-11-10 00:50:03,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873184167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26271086] [2024-11-10 00:50:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:03,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:03,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:03,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:50:03,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 00:50:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:03,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 00:50:03,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:50:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:04,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:50:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26271086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:50:05,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:50:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2024-11-10 00:50:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64681279] [2024-11-10 00:50:05,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:50:05,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 00:50:05,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:05,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 00:50:05,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:50:05,016 INFO L87 Difference]: Start difference. First operand 12400 states and 19128 transitions. Second operand has 29 states, 29 states have (on average 10.620689655172415) internal successors, (308), 29 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:07,265 INFO L93 Difference]: Finished difference Result 25255 states and 34846 transitions. [2024-11-10 00:50:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 00:50:07,265 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.620689655172415) internal successors, (308), 29 states have internal predecessors, (308), 0 states have call successors, (0), 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 128 [2024-11-10 00:50:07,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:07,280 INFO L225 Difference]: With dead ends: 25255 [2024-11-10 00:50:07,280 INFO L226 Difference]: Without dead ends: 16722 [2024-11-10 00:50:07,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=673, Invalid=2749, Unknown=0, NotChecked=0, Total=3422 [2024-11-10 00:50:07,289 INFO L432 NwaCegarLoop]: 2255 mSDtfsCounter, 31047 mSDsluCounter, 14004 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31047 SdHoareTripleChecker+Valid, 16259 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:07,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31047 Valid, 16259 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:50:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16722 states. [2024-11-10 00:50:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16722 to 12400. [2024-11-10 00:50:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12400 states, 12398 states have (on average 1.5339570898532022) internal successors, (19018), 12399 states have internal predecessors, (19018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12400 states to 12400 states and 19018 transitions. [2024-11-10 00:50:07,704 INFO L78 Accepts]: Start accepts. Automaton has 12400 states and 19018 transitions. Word has length 128 [2024-11-10 00:50:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:07,704 INFO L471 AbstractCegarLoop]: Abstraction has 12400 states and 19018 transitions. [2024-11-10 00:50:07,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.620689655172415) internal successors, (308), 29 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 12400 states and 19018 transitions. [2024-11-10 00:50:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 00:50:07,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:07,707 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 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:50:07,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 00:50:07,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-10 00:50:07,908 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:07,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:07,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1451245542, now seen corresponding path program 1 times [2024-11-10 00:50:07,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:07,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413465689] [2024-11-10 00:50:07,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:07,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 42 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:08,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:08,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413465689] [2024-11-10 00:50:08,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413465689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:08,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664374401] [2024-11-10 00:50:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:08,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:08,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:08,469 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:50:08,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 00:50:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:08,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-10 00:50:08,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:50:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 42 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:11,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:50:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 16 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:17,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664374401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:50:17,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:50:17,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 28, 28] total 65 [2024-11-10 00:50:17,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129662039] [2024-11-10 00:50:17,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:50:17,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-10 00:50:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:17,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-10 00:50:17,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=3568, Unknown=0, NotChecked=0, Total=4160 [2024-11-10 00:50:17,930 INFO L87 Difference]: Start difference. First operand 12400 states and 19018 transitions. Second operand has 65 states, 65 states have (on average 5.384615384615385) internal successors, (350), 65 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:27,677 INFO L93 Difference]: Finished difference Result 18596 states and 26526 transitions. [2024-11-10 00:50:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-11-10 00:50:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 5.384615384615385) internal successors, (350), 65 states have internal predecessors, (350), 0 states have call successors, (0), 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 128 [2024-11-10 00:50:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:27,692 INFO L225 Difference]: With dead ends: 18596 [2024-11-10 00:50:27,692 INFO L226 Difference]: Without dead ends: 14286 [2024-11-10 00:50:27,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6251 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=4232, Invalid=18118, Unknown=0, NotChecked=0, Total=22350 [2024-11-10 00:50:27,702 INFO L432 NwaCegarLoop]: 2226 mSDtfsCounter, 40870 mSDsluCounter, 46960 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40870 SdHoareTripleChecker+Valid, 49186 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:27,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40870 Valid, 49186 Invalid, 2923 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [114 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 00:50:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14286 states. [2024-11-10 00:50:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14286 to 7763. [2024-11-10 00:50:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7763 states, 7761 states have (on average 1.7256796804535497) internal successors, (13393), 7762 states have internal predecessors, (13393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7763 states to 7763 states and 13393 transitions. [2024-11-10 00:50:28,030 INFO L78 Accepts]: Start accepts. Automaton has 7763 states and 13393 transitions. Word has length 128 [2024-11-10 00:50:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:28,030 INFO L471 AbstractCegarLoop]: Abstraction has 7763 states and 13393 transitions. [2024-11-10 00:50:28,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 5.384615384615385) internal successors, (350), 65 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 7763 states and 13393 transitions. [2024-11-10 00:50:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 00:50:28,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:28,033 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2024-11-10 00:50:28,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 00:50:28,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 00:50:28,233 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:28,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1588418792, now seen corresponding path program 1 times [2024-11-10 00:50:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:28,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261985964] [2024-11-10 00:50:28,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 25 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:28,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:28,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261985964] [2024-11-10 00:50:28,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261985964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:28,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577415195] [2024-11-10 00:50:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:28,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:28,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:28,674 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:50:28,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 00:50:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:28,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 00:50:28,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:50:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 28 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:29,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:50:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 25 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:30,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577415195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:50:30,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:50:30,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-10 00:50:30,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711608904] [2024-11-10 00:50:30,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:50:30,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 00:50:30,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:30,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 00:50:30,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:50:30,601 INFO L87 Difference]: Start difference. First operand 7763 states and 13393 transitions. Second operand has 29 states, 29 states have (on average 11.413793103448276) internal successors, (331), 28 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:31,278 INFO L93 Difference]: Finished difference Result 10595 states and 16822 transitions. [2024-11-10 00:50:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 00:50:31,279 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 11.413793103448276) internal successors, (331), 28 states have internal predecessors, (331), 0 states have call successors, (0), 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 129 [2024-11-10 00:50:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:31,286 INFO L225 Difference]: With dead ends: 10595 [2024-11-10 00:50:31,286 INFO L226 Difference]: Without dead ends: 7933 [2024-11-10 00:50:31,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:50:31,289 INFO L432 NwaCegarLoop]: 2215 mSDtfsCounter, 17366 mSDsluCounter, 13511 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17366 SdHoareTripleChecker+Valid, 15726 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:31,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17366 Valid, 15726 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:50:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7933 states. [2024-11-10 00:50:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7933 to 7763. [2024-11-10 00:50:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7763 states, 7761 states have (on average 1.720654554825409) internal successors, (13354), 7762 states have internal predecessors, (13354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7763 states to 7763 states and 13354 transitions. [2024-11-10 00:50:31,541 INFO L78 Accepts]: Start accepts. Automaton has 7763 states and 13354 transitions. Word has length 129 [2024-11-10 00:50:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:31,541 INFO L471 AbstractCegarLoop]: Abstraction has 7763 states and 13354 transitions. [2024-11-10 00:50:31,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.413793103448276) internal successors, (331), 28 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:31,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7763 states and 13354 transitions. [2024-11-10 00:50:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 00:50:31,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:31,543 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-10 00:50:31,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 00:50:31,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:31,744 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:31,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash 557818754, now seen corresponding path program 1 times [2024-11-10 00:50:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:31,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415553693] [2024-11-10 00:50:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 25 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:32,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:32,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415553693] [2024-11-10 00:50:32,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415553693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:32,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449572467] [2024-11-10 00:50:32,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:32,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:32,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:32,477 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:50:32,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process